Once the algorithms are developed, also work to determine the worst-case complexity of the algorithms you have developed. Java.

Problem 1: Bounding Box Problem Given a set of points find the bounding rectangle that just contains the points. The rectangle is aligned such that the edges are horizontal and vertical - there is no need to rotate the rectangle. (Hint Basically, vou have to find the Xmax. Xmin. Ymax and Xmin of the points.) Input a set of points P = [(iy). (xn.) Output an array including the top left point coordinates of the bounding rectangle ree Yree, and the width and height of the bounding rectangle width.height