Please help, Im stuck!

For Problem 1, turn in a pdf with your answers. For Problems 2 and 3 , upload your code into laulima. Problem 1. This problem will cover tree traversals. As a short review, consider the following binary tree. The following are the result of a tree traversal: Pre-order list of nodes: A, F, H, K, G, Y, B In-order list of nodes: F,K,H,A,Y,G,B Post-order list of nodes: K,H,F,Y,B,G,A (a) [1 pt] Draw the binary tree with the following list of nodes: Pre-order list of nodes: A, F, H, G, K, Y, B In-order list of nodes: H,F,G,A,K,B,Y (b) [1 pt] Draw the binary tree with the following list of nodes: In-order list of nodes: H, Q, G, Y, D, A, F Post-order list of nodes: H,G,Q,A,F,D,Y