Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? O -3 is the root node and 10 and and 18 are among the...

Extracted text: Question 5 If we build the Max-Heap tree of the following set of data: [10, 2, 6, 7, 18, 0, -3, 5] Which of the following statements are not true? O -3 is the root node and 10 and and 18 are among the leave nodes. O 18 is the root node and 2 and and -3 are among the leave nodes. O 18 is the root node and 7 and and -3 are among the leave nodes. O 18 is the root node and 7 and and 10 are among the leave nodes. Question 6 In dynamic programming, the technique of storing the previously calculated values is called O Storing value property O Saving value property O Mapping O Memoization Question 7 A greedy algorithm can be used to solve all dynamic programming problems. O True O False