(2) Consider the following pseudo-code for a function that takes, as input, a parameter N: Function F(N) Loop i from 1 to N2 if F1(N) F2 (N) else Loop i from 1 to N F3 (N) if F4 (N) Loop k from 1 to N F5 (N) else F6 (N) For each of the following assumptions, analyze the worst-case running time of Function F using Big-Oh notation, Big-Omega notation, and Big-Theta notation, if possible. Express all answers using the tightest possible bounds. Briefly explain your answers! Note: In class, we went over rules related to Big-Oh notation. You will have to infer similar rules for the other notations. Assume that function F1 returns a Boolean value. (a) Assume that the worst-case running time of F1(N) is O(N), the worst-case running time of F2(N) is O(N), the worst-case running time F3(N) is O(N), the worst-case running time of F4(N) is O(N), the worst-case running time of F5(N) is O(N), and the worst-case running time of F6(N) is O(N)