Please answer 1-5~1-8

For each question from (1-1) to (1-8), mark T (or O) if the statement given is true, mark F (or x) otherwise. Note that you will earn 2 points for each correct answer and lose 1 point for each incorrect answer. You earn no point if you do not give any answer. (1) If a problem can be solved by a recursive algorithm, then the problem can be solved by an iterative algorithm with the same time complexity. (1-2) For sequential search, searching a data item in a data list sorted by the key values shows better worst case performance than searching in an unsorted data list. (13) The ADT (Abstract Data Type) of sparse matrix can be used for the ADT of general matrix. (14) Hashing can be applied to developing a sorting algorithm of time complexity no worse than (nlog2n) where n is the number of data items. (1-5) The relation among all the members of a family can be represented by a directed graph. (1-6) Heap sort algorithm belongs to the category of selection sorting. (1-7) Given a graph G , if there is a vertex v of G such that DFS(v) spanning tree is also the BFS(V) spanning tree of G, then G is also a tree structure. (1-8) When creating a B-tree from a list of data items, the data items must be already sorted by the key values