: Write a recursive Scheme procedure called $($deep$-$search Ist X$)$ that searches che Ist for any occurrence of x$.$ Return #t or #f depending on whether x is contained in st$.$ Any sub$-$lists of Ist should be searched as well.

For example:

$>($deep$-$search $22)$

#t

$>($deep$-$search $\text{'}(12345)7)$

#f

$>($deep$-$search $\text{'}(1(2(3)45))4)$

#t

$>($deep$-$search $\text{'}($a $($b $($c $($d $($e$)))))\text{'}$e$)$

#t

Copy your Scheme code without formatting in the box below: