Java Tree problem. Please show solutions (Drawing figures).

*NOTE*: NO code answers please.

Build a MAX-Heap that would result from the following numbers in the given order. 15, 25, 10, 33, 55, 47, 82, 90, 18 Draw the final heap using two formats: a tree and an array like Figure 6.31 in Page 336 in the textbook. You must build the heap using the algorithm in Page 333 in the textbook. Your final MAX-Heap as a tree: Your final MAX-Heap as an array