Please, can anyone help with this question? It's a C++ data structure question from one of the books. The topic is about "Time Complexity"

Thank you. Much appreciated.

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 aD, int n) llargs: array a[] of size n for (int k n/2, k 0, k/ 2) for (int j 30: j