Star Triangle By Recursion

Complete print_stars(n: int) -> None so it prints a triangle of n rows where the first row holds one star and each row holds one more star than the row above it, using recursion. The base case is written: zero rows prints nothing. Add the recursive case: call the function with n - 1 FIRST, so the shorter rows come out before this one, then print a row of n stars built with string repetition, "*" * n. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one integer n, no prompt, which the tests read and pass to your function.