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 integerprint$($triangle$(4))$ be graded, make sure your

Notes:

The doctest includes $\frac{\frac{?}{?}}{?}$ n instead of $\frac{?}{?}$

in order to keep consistent leading whitespace

required by the shell session, your code must return output with as $\frac{?}{?}$

$,$ otherwise it will fail

the test cases!