1. Compare the growth rate of the following functions by filling in blank with or>(10pts) N4 2N73 5N2 log N--N3 ION-_ 4MogN 30 4M N2SN+76v2SN logtNN log N 2N2+5N+7 2 Match the big-O notation for (10pts) 1 O(n 2. O) b. Am)2n+nlog(n)+1 d. Am)- log(n) + 5 eA") = n + 5 log(n) + 67 f fin) -50+6 4. O(log(n) s O(unlog(n) 3. Check the following piece of code, and analyze the complexity with big-O notation. (Spts) int fun (int n) int count = 0; for (int 1-0inext: current-next- temp curzentcurrent->prev: if (temp t NULL) head_rettemp->previ Assume that reference of head of following doubly linked list is passed to above function 453621. What should be the modified linked list after the function call? (Spts) (A) 263541 (B) 126354 (C) 4 5362 1 (D) 1 23456