Answer following questions and write corresponding algorithms. (a) Consider a recursive algorithm called sqrt(n) that calculates n. For example, sqrt (16) =4, sqrt (18) =4, sqrt (26)=5. What should be the four missing input arguments in the main and helper functions? Algorithm: sqrt (n) [main] Algorithm: sqrtHelper (n,m) 1. if mmn You should write the full algorithm with headers in the main algorithm and helper functions. Compare two algorithms for solving the same problem in (a) and (b), and state which one is more efficient? Briefly explain your answer with examples. (c) Write an recursive algorithm called isPrime(n) that takes a positive integer and returns True if it is prime and False otherwise. You must call the function sqrt(n) as a subalgorithm. Trace your algorithm for isPrime(41). You only need to show the detail in the main algorithm and its helper function (if there is any)