Answer the following questions:a$)$ How can you define the problem as a smaller problem of the same type?b$)$ How does each recursive call diminish the size of the problem?c$)$ What instance of the problem can serve as the base case?d$)$ As the problem size diminishes, will you reach this base case?What is the output for the following statement? Design a Recursive diagram cout $$ Mystery $(128,32)$ endl