Describe a linear time algorithm (i.e. O(n) which finds the minimum rectilinear disk containing given n points in rectilinear plane. Hint: A rectilinear disk is a square (90 degrees rotated) You need to find a 90 deg rotated minimum square containing all points