In C++ language and please, give h. source.cpp and main.cpp

2 2 1. An Preorder traversal {1, 9, 4, 8, 7, 6} and an Inorder traversal {3, 1, 9, 4, 7,6} of a binary tree is given print its Postorder traversal. 2 2 2. Count all possible paths from A to E. B E A D