Complexity Analysis Give the runtime complexity of the following code segments (eg, (n), (n2), (1), (log(n))). The input size is n. Give the tightest possible bound. Remember to ignore coefficients and lower- order terms 1. int count n; for(int i-0; i0 )1 for (int j=0; jen; j++) System.out.prinln("Applejack"); Answer (2 points): 4 for (int n/2 ; 0; i--) System.out.println ("Arrays begin at zero"); Answer (2 points)><>