Let us consider the following binary tree, called T.\ Select one or more:\ a. If A=9, B=8 and C=4, then T is a Min-Max Heap.\ b. If A=9,B=8 and C=4, then T is binary search tree.\ c. If A=9, B=8 and C=4, then T is a Max-heap.\ d. If A=9, B=8 and C=4, then T is a Max-heap.Let us consider the following binary tree, called T.\ Setect one or more:\ a. If

A=9,B=8

and

C=4

, then Tis a Min-Max heap\ b.

A=9,B=8

and

C=4

, then

T

is a binary search tree\ c.

A=9,B=8

and

C=4

, then

T

is a Max-heap\ d.

A=8,B=9

and

C=4

, then

T

is a Max-heap

Let us consider the following binary tree, called T. Select one or more: 2. If A=9,B=8 and C=4, then T is a Min-Max heap b. A=9,B=8 and C=4, then T is a binary search tree c. A=9,B=8 and C=4, then T is a Max-heap d. 1A=8,B=9 and C=4, then T is a Max-heap