We can define the distance between two points in ways other than euclidean. The L[infinity]- distance between points p1 = (x1, y1) and p2 = (x2, y2) in the plane is given by max(|x1 − x2|, |y1−y2|). Modify the closest-pair algorithm seen in class to use the L[infinity]-distance. Justify your algorithm and analyze its running time. Also, write the recurrence for the running time T(n) of your algorithm.

we have been given a quadratic function and we need to restrict the domain such that it becomes a one to one function.

we know that vertex of this quadratic function occurs at (5,2).

further, we know that range of this function is .

if we restrict the domain of this function to either or , it will become one to one function.

let us know find its inverse.

upon interchanging x and y, we get:

let us now solve this function for y.

hence, the inverse function would be if we restrict the domain of original function to and the inverse function would be if we restrict the domain to .

prndulum needs thread, weight clock to time swings