For each statement in the following, please indicate T or O if it is correct and indicate F or X otherwise. (You get 2 points for each correct answer and lose 1 point for each incorrect answer.) (3-A) A stack can be implemented by using either data structure of queue, array or linked list. (3-B) In representing a network No, using an adjacency list always consumes less memory space than using an adjacency matrix. (3-C) A connected acyclic undirected graph is actually a tree structure. (3-D) Given a binary tree T of no leaves, the height of T is at least logano 7+1. (3-E) When using bubble sort algorithm to sort n (n>2) data items, if the number of key comparisons is k and k 2) data items using the heap sort algorithm, if k denotes the number of key comparisons and m denotes the number of data movements incurred from maintaining the order of the data items, then m > k. (3-G) If a binary search tree T is a complete binary tree, then T is an AVL tree. (3-H) If the adjacency list of a digraph G=(V, E) has in? nodes, then G is strongly connected. (3-1) When using hash table to search in n data records, the load factor lf= 1 implies that the hash function is an order-preserving hash function