solve this question in details

Question 2: Given the algorithen below, provide example value of a, b and key for both Best case and Worst-case scenario. Assume the size of a and baren where n - (last 2 digits of your id % 3) . 6. Algo2(a[1, bb, key) // a[] and b[] are of size m for (4 1 ton) if(a[1] + b[n-i] -- key) return true return false