PLEASE SOLVE ONLY FOR THE BIG-O NOTATION PLEASE! I DON'T NEED THE CODE!

(Python)

Write a function 'powr(x,n)' that will compute x^n (x to the power of n). Obviously, you should not use the built-in Python operator (or library functions) to accomplish this. Do the computation manually (Hint: loop). Pay attention to the algorithmic complexity. What is the best possible big-O? Example: powr(3,2) -> 9

Write a function 'prime(x,y)' that calculates the prime numbers for a given range specified by the two parameters. For example, if x is 100 and y is 200, your function should print the following: 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199. What is the best possible big-O?