It is possible to change the way that we pick the dividing point in a binarysearch, and still get a working search routine. However, where we pick thedividing point could affect the performance of the algorithm.(a) If we change the dividing point computation in function binary fromi = (l + r)=2 to i = (l + ((r ?? l)=3)), what will the worst-case runningtime be in asymptotic terms? If the difference is only a constanttime factor, how much slower or faster will the modified program becompared to the original version of binary?