Consider the problem called BoxDepth: given a set of n axis-aligned rectangles in the plane, how big is the largest subset of these rectangles that contain a common point?(a) Can you nd a polynomial running time algorithm for BoxDepth? (5pts)(b) Describe a polynomial time reduction from BoxDepth to MaxClique (i. e., given an instanceof BoxDepth, transform it to a problem of MaxClique).(5pts)(c) Can you nd a polynomial time reduction from MaxClique to BoxDepth? If so, provideone. If not, explain why. (5pts)