$($f$)$ You are given the in$-$order and post$-$order traversals of a binary search tree:

In$-$order traversal: $4,2,5,1,3$

Post$-$order traversal: $4,5,2,3,1$

Construct and draw the binary search tree from these traversals and briefly explain your

approach.