1 [20 points] State whether True or False: A. N1.5 is O(N log N). B. 1.011 is O(N1000). C. 1/N is O(log N). D. log Nis O(VN). E. N+ VN is O(VN log N). F. In a binary tree every node must have at least one child node. G. The Binary Search Tree is always a balanced tree. H. The number of leaf nodes and internal nodes in a binary tree can never be equal. I. The Postorder traversal of a binary search tree (BST) outputs the key values in non-increasing order. J. In an expression tree, the operators could be at the leaf nodes. K. The deletion of a key in a BST has a higher time complexity than key search. L. A binary search tree (BST) has to be a complete binary tree. M. If a node in a BST has two children, then its Inorder successor has no left child. N. An array that is in sorted order is a Min-heap. 0. The array representation of a Min-heap is always sorted. P. In a B-tree, the lengths of the paths from the root to all leaf nodes may be different. Q. In a B-tree, deletion of a key will never alter the height of the tree. R. The complexity of key insertion in a B tree is higher than that of deletion. S. In an AVL tree, the longest and the shortest paths (number of edges) from the root to a leaf do not differ by more than 1. T. In an AVL tree, rotations may not maintain the Inorder ordering of keys