Question $6(2$ marks$)$

A$.$ In pseudocode, describe a findAll Elements $(k)$ method of an AVL tree $T.$ It should run in $O(logn+s)$ time where $n$ is the size of $T$ and $s$ is the

number of elements returned $($i$.$e$.,$ the number of nodes in $T$ whose key is $k).$

B$.$ Analyze the running time of your algorithm.

thank you for your help.