$(20$ points$)$ For each statement, indicate whether it is possible to uniquely identify a tree for the given traversal combinations and provide a proper reason for the answer$($Marks will be awarded if the correct reason is mentioned$).($a$)$ Postorder and Level$-$order $($b$)$ Inorder and Preorder $($c$)$ Inorder and Level$-$order $($d$)$ Inorder and Postorder $($e$)$ Postorder and Preorder For the cases where traversal combinations can uniquely identify a tree, provide pseudocode to construct a tree from those traversal combinations as input.