Question $1$: Binary Trees. Given the postorder and inorder traversal of a binary tree, construct

the binary tree and output its preorder traversal. Then given two binary trees, determine whether

it is a subtree of the other binary tree. A subtree of a tree $T$ is a tree consisting of a node in $T$ and

all of its descendants in T$.$ For example, the second tree is a subtree of the first tree.

Example Representing this tree:

Example Input$/$Output:

$>$ Enter the inorder traversal of tree

$4$

$2$

$5$

$1$

$6$

$3$

$74$

$5$

$2$

$6$

$7$

$3$

$1>$ Enter the inorder traversal of second tree

$6$

$3$

$7$

$$ Enter the postorder traversal of the same tree

$6$

$7$

$3$The answer to whether the second tree is a subtree of the first is: Yes

Please write code in java :)