Consider the problem of determining the number of different orders in which n matrices can be multiplied. (a) Write a recursive algorithm that takes an integer n as input and solves this problem. When n equals 1 the algorithm returns 1. (b) Implement the algorithm and show the output of the algorithm for n = 2, 3, 4, 5, 6, 7, 8, 9, and 10.