Question 6 (1 point) In a tree. the highest (or lowest) priority element is always stored at the root of the Save Question 7 (1 point) If a tree satisfies theproperty such that if P is a parent node of C, then the key value of Node P is greater than the key value of Node C. The data type is called a Save Question 8 (1 point) Which data structure is used to implement undo and redo 1) Stack 2) Queue 3) Tree 4) Graph Save