Let T be the root node of a non$-$empty Binary Search tree. Consider the following algorithms:

Due date:

PrintTree$1($T$)$

if T $=$ NIL

if T$.$left $=$ NIL

print T$.$key PrintTree$1($T$.$left$)$ PrintTree$1($T$.$right$)$

PrintTree$2($T$)$

if T $=$ NIL

if T$.$left $=$ NIL

print T$.$key PrintTree$2($T$.$left$)$ PrintTree$2($T$.$right$)$

PrintTree$3($T$)$

if T $=$ NIL return $0$

else

h $=$ PrintTree$3($T$.$left$)+1$ if h $>4$

print T$.$key return h

PrintTree$4($T$)$

if T $=$ NIL return $0$

else

h $=$ PrintTree$4($T$.$left$)+1$ print h

return h

Describe in English the printed output of each of the above algorithms. Execute each of these algorithms on the following tree: