INORDER$-$TREE$-$WALK $($x$)1$ ifx # NIL$2$INORDER$-$TREE$-$WALK$($x$.$left$)3$print x$.$ key$4$INORDER$-$TREE$-$WALK$($x$.$right$)($a$)$ Pseudocode$($b$)$ The input tree$3.(20$ points$)$ Binary Search Tree$($a$)(5$ points$)$ What property should a binary tree satisfy in order to be a binary search tree?$($b$)(10$ points$)$ Given the pseudocode of Inorder$\_$ Tree$\_$Walk$($T$.$root$)$ and the example input, write down the expected output.$($c$)(5$ points$)$ What is the scarch comploxity in binary scarch tree?