Using pseudo-code, describe an algorithm that will receive an unsorted array (a list of integers where the first index is 0) and find the index location of all integer(s) closest to zero. consider this example: 7. array [7,-8, 3, 2, 14,-5, 6, -2, 10, 2] indeces closest to zero 3, 7,9

is there a picture

step-by-step explanation:

answer:   28.56 feet (approx)

step-by-step explanation:

since, triangle abc has measure of angle c equal to 55 degrees, measure of angle abc equal to 90 degrees, and length of bc equal to 20 feet.

we have to find out the measurement of segment ab.

therefore, tan 55° =

but bc = 20 feet.

⇒ tan 55 ° =  

⇒ ab = 20 × tan 55 °

⇒ ab = 20 × 1.42814800674

⇒ ab = 28.5629601348   ≈ 28.56 feet

the answer is that it is true