For a recursive algorithm _________
(a) a base case is necessary and is solved without recursion.
(b) a base case is not necessary
(c) doesnot solve a base case directly
(d) none of the mentioned
This question was posed to me in an interview.
My query is from Algorithms in portion Algorithms of Discrete Mathematics