Signature: 24 single answer multiple choice Questions (2 each) box (in front of each Answers must be written in capital letter and put in answer If there is no base c coded in a recursive program, the program will question). a) execute until all conditions match b) not be executed c) run infinitely d) execute until crush occurred Which of the following is characteristics of greedy algorithms de a) make a of far, only depends on what's been done so far b) choice is the one that seems best so solved d) choice produces a smaller problem to be d) All of the above Which of the following is not the component of data structure? a) Algorithms b) Storage Structures c) Operations d) None of above Find the output of the following code segment public class test System.out.println(fun(5)); public static void main(Stringllags) public static int fun(int n) f (n return 1 else return n fun(n/2); a) 9 b) 6 c) 7 d) 8 Dynamic programming approach can break down an original problem into number of