5. Find the solution to a instance of the travelling salesman problem by exhaustive search 4 A B 1 6 N 8 6. S(n) I/Input: A positive integer n I/Output: The sum of the first n Square If n=1 return 1 else return S(n-1) = n*n a. Set up and solve a recurrence relation for the number of times the algorithm's basic operation is executed. b. How does this algorithm compare with straight forward non recursive algorithm for computing this function