Consider an array of size nine with the numbers in the following order: 40, 60, 20, 80, 70, 90, 30, 10, 50. (a) Create the heap using the algorithm described in class. Show the heap as a tree. Show the heap as an array. Exactly how many comparisons did heap creation use

See attached picture for heap creation steps.

10 comparisons were used.

Explanation:

See attached pictures.

definition of done. the definition of done may be changed at any time to reflect what a team can complete within each sprint. however, changing the dod should be an infrequent occurrence, and never something done prior to each sprint.

explanation:

answer; i believe that the above statement is (true);