Need urgently, in C++! N.B: Each task must need to include header (.h) file, source file (.cpp), and driver file (main.cpp). You need to attach output snapshot must. Please follow this instructions and solve ASAP...

1. A preorder traversal {4, 2, 0, 1, 3, 9, 7, 5, 11, 17}and an inorder traversal {0, 1, 2, 3, 4, 5, 7, 9, 11, 17} of a binary tree is given print its postorder traversal. 2. Count all possible paths from B to C. B E A D