7.True/False, if false write the correct. a) Height of the B-tree is log(n) b) Insertion in a heap will always take O(1) time c) BST will always be balanced. d) Expected number of comparisons for an unsuccessful search in a hash table of size 20 in which 60 keys are stored (with chaining) is 3 e) Arrays can be used to store a BST and a heap t) Running the DFS and BFS on a connected undirected graph which is also a tree creates the same result (tree). g When Dijkstra's algorithm is run on a graph with adjacency matrix representation, the complexity will be O(E log V). h) Adjacency matrix representation of graphs is better than adjacency list for dense graphs