Question 3: Give the exact operation count for function F hereafter, counting every assignment, comparison, addition, etc. as 1 operation, and knowing that the 'if test succeeds half the time. Show all details and justify as necessary. Indicate accordingly the worst/best time complexity of this function. (5 marks) void F (int a, int n) args: array al ] of size n for (int k-n/2; k>0; k/-2) for (int j 0; j