Problem 1. (50 POINTS) We perform an in-order and pre-order traversal on an arbitrary binary tree For each one of the traversals we get as output: In - order : 1,2,4,3,7,6. Pre - order : 4,2,1,7,3,6. Show the binary tree that is consistent with these two traversals