Please send the solution quickly

(10 Marks) on a positive runtime 1 (a) Choose the correct answer (MCQ): ) ( (1) The Big-O notation, O(g(n)), is used to give aan function fin) where n is the input size. a) Average Case c) Worst Case b) Best Case d) None of these (11) To represent hierarchical relationship between elements, which of the following data structure is suitable? ? a) Graph b) Tree e) Priority Queue d) Stack (ili) Which one of the following is a non-linear data structure? ? a) a) Circular Queue c) Queue b) Tree d) Stack ) (iv) The a) In degree b) b) Size of a vertex Vin a graph is the number of edges incident on V. c) out degree d) height (v) The height of a tree is the height of its a) Leaf node b) Root Node c) sub tree d)None of these graph representation, the edges are represented as an array of linked (vi) In a/an lists. a) Adjacency list b) Linked List c) Adjacency matrix d) Simple List (vii) In depth first search graph traversal algorithm, which of the following data structure is used? a) Stack c) Queue b) Linked List ) d) Priority Queue ( (vill) In separate chaining the hash table is implemented as aan a) Array c) Aray of linked list b) Linked list d) Stack (ix) Finding the shortest path from one city to another is an application of a a) Queue c) Tree b) Stack ) d) Graph (x) The allows the storage and retrieval of data in an average time which does not depend at all on the collection size. a) AVL Tree c) Hashing c) b) Queuing d) Graph )