Create an optimized function print s(n,s) that prints the given argument s (representing a string) k times. k represents the number of iterations of the inner loop. The print statement that prints s is in the inner loop of the function (a) Initial conditions: i = 1, j = 1, i <= n, and j <= i (b) i and j increments: i = i + 1 and j = j 2 (c) input as arguments in the function: n (an integer representing the size of the input), and s (the string) (d) output: print s k times ( e) example: n=5, s= hello, given these conditions, the function print s(n,s) will print s 11 times 1. Describe the algorithm to solve the problem. Note that you must show all your work (e.g including summations) what's the complexity function T(n).