Need an answer ASAP. Will give a thumbs up.

What is the Postfix notation corresponding to the following expression tree? f d h Select one: a. fec/dh+*+ O b. Operands should be in non-leaf nodes c. No Postfix notation is associated with it O d. + */+fecdh What are the correct values for variables from a to i of the following B-tree for these set of elements "19, 31, 130, 40,7,80, 84, 25, 2, 91, 101, 95, 12, 49, 60, 99, 51"? 51 12 1 HITE 2 e 25 49 60 91 130 E Select all that apply: O a. a=31, b=84, c=99, d=7 b. d=7, e=19, f=40, g=80 c. g=80, h=95, i=101 d. c=95, a=19, g=95, h=101 O e. b=84, C=80, d=7, e=31, f=40, g=99, h=95, i=101 Let us consider the binary trees below. B B D E d) Select all that apply: a. For tree d), if we remove node F, then the tree will have the AVL property. b. For a binary tree that does have the AVL property. If the property is violated after inserting one node, then the property can be restored using an algorithm (based on rotations) that runs in quadratic time cost (O(N2) where N is the number of nodes. O c.Tree in c) will not have the AVL property, if a right child is added to node C. d. Both trees c) and d) have the AVL (height-balanced 1-tree) property. I e. For tree d), if we remove node C, then the tree will have the AVL property