IMPORTANT: You are not allowed to use loops in any form, global variables, the in operator, or list methods in any portion of this assignment $($len$()$ is the only method that you are allowed to use$).$ You will not receive credit if you use them. The use of helper functions is NOT allowed. Other restrictions apply per function.

recursive$\_$triangle$(k,n$

$(1\mathrm{.}5$ points$)$

In the starter code, there is a function called triangle that calls the function recursive$\_$triangle $(n,n)$ once. You must write the recursive function recursive$\_$triangle $(k,n)$ that returns a string with the LAST $k$ lines of a right triangle of base and height $n.$

Don't modify anything in the triangle function. If your recursive function is correct, calling triangle $(n)$ should return the complete right triangle.

Preconditions

k: int $$ Positive integer

$n$: int $$ Positive integer

$>>$ triangle $(4),$ This is the output that will

$>$ print$($triangle $(4))$

$*********$ be graded, make sure your

Notes:

The doctest includes $II$ n instead of $ln$ in order to keep consistent leading whitespace required by the shell session, your code must return output with as $\frac{\frac{?}{?}}{?},$ otherwise it will fail