If T(n) is the number of additions, what is the complexity of candies (n)? void candies (int pounds) { if (pounds == 0) return 0; else { options = 0 for (i = 1; i < pounds; i++) options+ = candies( i ) } return options }

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

public class Main {      static int findPosSum(int A[], int N)  {  if (N <= 0)    return 0;       {      if(A[N-1]>0)      return (findPosSum(A, N - 1) + A[N - 1]);      else      return findPosSum(A, N - 1);     }   } public static void main(String[] args)  {    int demo[] = { 11, -22, 33, -4, 25,12 };  System.out.println(findPosSum(demo, demo.length));  } }  Consider the recursive function you wrote in the previous problem. Suppose the initial call to the function has an array of N elements, how many recursive calls will be made? How many statements are executed in each call? What is the total number of statements executed for all recursive calls? What is the big O for this function?

In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.