Solve a, b , c and d and this is term

Question/4: Given the following algore ALGORITHM Fin) Input: A nonnegative integer I/Output: The value of n! if = 0 return 1 else return F(n-1). . What does this algorithm compute? What is its basic operation? c. How many times is the basic operation executed? d. What is the efficiency class of this algorithm? a. Sakt Question: Fill in the blanks (4 marks) is a general approach to solving problems algorithmically that is applicable to a variety of problems. b. Sclecties.Set is to rearrange the items of a given list in no decreasing order. c. A, ORA.buce each node except the last one contains a single pointer to the next element. d. -last.-Guse indicates how fast an algorithm in question runs