Task 1: Consider the following pseudocode function that describes the Ro Search algorithm: In this pseudocode floor (x) and ceiling (x) are the mathematical functions that, respectively, give the largest integer smaller than or equal to x and give the smallest integer larger than or equal to x. You may assume that calculating the f loor (x) and ceiling (x) takes constant time. For this algorithm address the following: 4. The Theta notation for the worst-case and best-case running times T(N). In particular, find a set of constants c1,c2 and m0 for which T(N) is (g(N)).[6 marks]