Recall the following deterministic select algorithm:(a) Divide thenelements into groups of size 5. Son/5 groups.(b) Find the median of each group.(c) Find the medianxof then/5 medians by a recursive call to Select.(d) Call Partition withxas the pivot.(e) Make a recursive call to Select either on the smaller elements or larger elements (de-pending on the situation); if the pivot is the answer we are done.

step-by-step explanation:

this can be solved first with pythagorean theorem, which tells us to square both legs of the triangle and sum it. this will be equal to the square of the hypotenuse.

the hypotenuse is the side "opposite" the 90 degree angle, which is x.

so we can write using pythagorean theorem,

simplifying:

to further simplify this radical, we need to use the property  

thus

multiplication is multiplication.   it might feel harder depending on what level of math you are in, but generally it will be the same old stuff, while implementing some new concepts and methods of solving work.