Question 1: Consider the code of function F below, that takes 3 arrays and the size n as input. Assume in the following that the if test succeeds halfthe time. void F (in*lhs, int**rhs, int **res, int n) for ( int i = 0; i = res [j][i] ) res [i]U-2; else { int m = res [i][j]; res [i][j] = res [j][i]; res U][i] m; } lI (a) Give an approximation of the O) complexity. Justify your resul mark) (b) Derive the exact operation count for F, showing all the details of your calculation and justifying as necessary. Give the O() accordingly