Given the pseudocode below, draw a recursive tree for the following input where each node in the tree

shows the input for that call to the function. Don't forget empty lists.

thinct. $1$ on $.$

if $1$ ang $1.h(T)=.$

return $L$

lef: $=$

right $=[]$

$p=L[0]$

tor a in rest $($L$)$

$1+AF$

append $($lert$,$ e$)$

else

append $($right $,$ e$)$

return left