(a) According to the binary tree shown below, please provide final results of pre-order (3%), in-order (3%), and post-order (3%) traversals.

(a) It is common to implement the DFS algorithm with a Stack. However, the stack may be used differently in different implementations. You are tasked to implement the DFS algorithm for any given graphs. Explain how you are going to use the stack in your implementation.(7%)