**Question **# Determine the running times of the following function (as tight upperbounds). Justify your answers. You may give the answer in O(...) form. In addition, describe in words what this function computes.3. Function fnA, given below, if both arrays arrayA and arrayB contain n elements and both arrays are already sorted. The function binary Search execute s the usual binary search algorithm.