Q1. Consider the following C program, indicate clearly the time complexity 7 points for each statement (if any). * 2 3 4 6 7 8 9 10 11 17 18 19 20 21 - 1 #include #define N 8 int main() 5-{ int i, c, first, last, middle, search, array[N]; FILE"myFile; myFile = fopen("id.txt", "r"); for (i = 0; i last) 34 printf("Not found! Please proceed with registration. "); 26 30 31 35 36 return; Your answer Q2. Determine the worst-case time complexity and Big-O of the program 2 points in Q1. * Your