Consider a binary tree with six nodes with the values $10,20,30,40,50,$ and $60$ in such a way that the inorder and postorder traversals of the tree yield the following lists:

$40,20,10,50,30,60($inorder$)$

$40,20,50,60,30,10($postorder$)$

For the resulting binary tree, select the correct answer to the following questions. Note that root node is considered level $0,$ then level $1,$ and so on$.$

$($a$)$ Value of level $0($Root$)$

$($b$)$ First value of level $1$

$($c$)$ Second value of level $1$

$($d$)$ First value of level $2$

$($e$)$ Second value of level $2$