Given the following recursive function:

public static String mystery$($String s$)$

$\{$

char $[]$ temp $=$ new char$\backslash [1\backslash ]$;

if $($s$.$equals$(""))$ return $""$;

if $("$aeiouAEIOU$".$indexOf$($s$.$charAt$(0))!=-1)$

$\{$

temp$\backslash [0\backslash ]=$ s$.$charAt$(0)$;

return new String$($temp$)+$ mystery$($s$.$substring$(1))$;

$\}$

else return $""+$ mystery$($s$.$substring$(1))$;

$\}$

Show all the calls to the function and what each one returns to its predecessor.

String result $=$ mystery$($Omar$)$;

Call #

$1.$ mystery$($Omar$)$ returns

to result

$2.$ mystery$($

$)$ returns

to Call

$3.$ mystery$($

$)$ returns

to Call #$2$

$4.$ mystery$($

$)$ returns

to Call

$5.$ mystery$()$ returns $$ to Call #$4.$