please solve this. it is functional programming in scheme$/$Racket$.$ tnx$.$ Please solve as faster as you can. TASK $2.$

Context

In this assignment, the focus is on recursion, a key concept in functional programming.

Tail recursion is a technique where the recursive call occurs as the last operation in a function, allowing optimization by the interpreter.

An example of a tail$-$recursive function

$($define $($mystery$-$func x y$)$

$($if $(>$x $0)$

$($mystery$-$func $(-$x $1)(+$ y x$))$y$))$

Claims, true, false, i dont know

$1.$ If we call mystery$-$func with arguments $(4,0),$ the third recursive call will be with arguments $(1,6).$

$2.$ If we call mystery$-$func with arguments $\backslash ((4,0)\backslash ),$ the third recursive call will be with arguments $\backslash ((0,15)\backslash ).$

$3.\backslash (\backslash$square $\backslash )$ The function mystery$-$func is not tail$-$recursive.

$4.$ The complexity of the mystery$-$func function is linear, $\backslash ($ O$($n$)\backslash ).$

$5.$ The complexity of mystery$-$func is quadratic, $\backslash (\backslash$mathrm$\{$O$\}(\backslash$mathrm$\{$n$\}2)\backslash ).$

$6.\backslash (\backslash$square $\backslash )$ Tail recursion in mystery$-$func causes a stack overflow for large values of x $.$

$7.\backslash (\backslash$square $\backslash )$ In mystery$-$func, $\backslash ($ y $\backslash )$ acts as the current, throwaway value through recursion.

$8.\backslash (\backslash$square $\backslash )$ The base case in mystery$-$func is when $\backslash ($ x $\backslash )$ is less than or equal to $0.$

$9.\backslash (\backslash$square $\backslash )$ The mystery$-$func function changes the original values of the global variables $\backslash ($ x $\backslash )$ and $\backslash ($ y $\backslash )$ outside its scope.

$10.\backslash (\backslash$square $\backslash )$ mystery$-$func returns the value $\backslash ((-\backslash$mathrm$\{$x$\}1\backslash ))$ when it reaches the base case.

$11.\backslash (\backslash$square $\backslash )$ The depth of recursion in mystery$-$func depends on the size of the argument $\backslash ($ x $\backslash ).$

$12.\backslash (\backslash$square $\backslash )$ The mystery$-$func function accumulates the sum of numbers from $\backslash ($ x $\backslash )$ to $1.$

$13.\backslash (\backslash$square $\backslash )$ mystery$-$func cannot handle negative values $\backslash ($ x $\backslash ).$

$14.\backslash (\backslash$square $\backslash )$ Testing mystery$-$func with arguments $\backslash ((5,0)\backslash )$ returns $15.$

$15.\backslash (\backslash$square $\backslash )$ Testing mystery$-$func with arguments $\backslash ((5,0)\backslash )$ returns $14.$

$16.-$ Testing mystery$-$func with arguments $\backslash ((5,0)\backslash )$ returns $16.$