Write a C++ program with a function written based on the above algorithm. Now call this function suitably by sending two inputs a and b. Before calling the function Euclid, must check ifa>b, if not first swap them using a swap function. 5. An algorithm takes f(N) seconds to run the algorithm. Determine the maximum value of N, that the algorithm can complete in (a) one minute (b) in one hour and (c) in one day. Given f(N) - N(N-172 This can be done by writing a computer program, with a function for f(N) and then in the main, initialize N to 1, and then write a loop to check f(N)