Design a recursive algorithm called Extrema (, p, ) that, given an array [1⋯] finds and returns both the min and max of the subarray [p⋯] as an ordered pair: (min([p⋯]), max([p⋯])). Your algorithm should perform exactly ⌈3/2⌉−2 array comparisons on an input array of length . (Hint: Section 9.1 of the text describes an iterative algorithm that does this.)

d. $180

step-by-step explanation:

if the dimensions of the room is 9ft by 12 ft, we have the area of the floor as,

so the area of the floor is 108 square feet, converting that into square yards we get,

the cost of carpet is $15 per square yard, therefore the cost of carpet for 12 square yards is,

hence, the cost of carpet is $180.

assuming the dimensions of the room be,

15 ft by 12 ft

so, the area of the floor of that room is,

we can convert 180 square feet into square yards, we know that,

1 sq ft = 0.111 sq yard

so, 180 square feet is,

so the area of floor is 20 square yards.

now, the cost of carpet is 15 dollars per square yard, therefore the cost of carpet for 20 square yards is,

so, it will cost $300.

too hard the other guy did it

step-by-step explanation: