3 (10 (a) ) Write YES or NO for each of the following questi () ()+O ) (1) Is (m)+ CO) ? (c) E tre? (d) B(+3)") tree! (e) s (m) + (w) = 0 ) true! 4. (10 pts) Write true or false to each of the following statements () () +8, then fin) 0.2"). (1) ffin) then fin) B log) (c) Iffin) E () and (w) On), then fin) + (6) EO ) (d) I fin) e Ox), then x fin) E 0("). () f ) On) and g(n) 0.), then f(n) g(n) (n.). (1) Iff) Enn ), then fin 0(lon). (*) I ) E O(n) and g(n) (n), then lime (1) (ha) f(n) (n) and g(n) (n), them lime (1) (1) If ) {n) and g(n) [n), then lim e (1). U) fin) + () (max fin) ). 5. (10 pts) Support that you have a function int Fibonacci(int n) which take in a positive intern and the nth Fibonacci number. Assume that your function is in form it rea l when=lo 2 e Fibonacci (n-1) + Fibonacci (n-2) when > 2. In addition, me that your function writes out BGN Fibonacci n at the start of the function, and writes ont EXD Fibonacci - before the end of the function, where the value of the input parameter You also have a sin program which reads in a positive integek and calls Fibonacci (e) Al me that you in tam wieso BCN sain at the start of the m , and = =5 L=10 L=2000 Total number ok calls to Fibonacci Mari TGN END Here in the c row, you are to write at the maximum vale (during the section of the program of the sumber of printed out in the number of END printed out