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)

sory but complete the question

add the following

depends on what software you are using. google docs or microsoft word or other?

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)