5. The order of the nodes visited in a binary tree T using preorder traversal is F, A, H,I,B, L,J,E, D,G, K, C, M. If inorder traversal is used, it is H, I,A, L,B,J, F, D, G, E, K, M, C. Please draw the binary tree T. (20%)