1. When we analyze the growth of complexity functions, Roy and gin) are always a. Positive b. Negative C. Positive or negative d. All of the chore 2. A problem that can be solved with polynomial worst case complexity is called A. uviolvoble b. Intractable C Tractable d None of the above 3. What is the growth of the function: fix) -3x:2 - 2x 1 1 Mini is defined moonively bry Recursive step: fix : 1) - for 1 380 - 1x, then the value of /3) h 5. Assume that the encryption function is (()(lav! !) med 26, What is the culpus if a - 57 Assume that you are playing dungeons and dragons and the dice has Halden. The manbers on the dice are (1,3.73,4,4.5.67. What is the probability that the number you roll by b h ra d. None of the given options 7, In induction method to show that a propositional function Pin) in true for any integer pel. the basic step is to show thatis true: b. P(D) C P(D) d P(3) c, Band C