all three pleaseAs many points

Use the following digraph of a labeled positional binary tree to answer questions 4 through 6. Using the above binary tree, assume visiting a vertex prints out the label of the vertex. Write the results of a preorder search. Using the above binary tree, assume visiting a vertex prints out the label of the vertex. Write the results of a inorder search. Using the above binary tree, assume visiting a vertex prints out the label of the vertex. Write the results of a postorder search