hello,i don't have enough time please help me this part is fill in the blank all what i need is to answer with "True or false " in question 1,2,3 and fill in the blank in question 4,5 and 6

please i need only answers without explanation please only answers

Part B Fill the blanks 1. The major task of algorithm analysis is to analyze the time complexity and the space complexity. (True or False) 2. To sort N distinct records by bubble sort, the number of record swaps must reach its maximum when the original sequence is almost in sorted order. (True or False) 3. Prim's algorithm is to maintain a forest and to merge two trees into one at each stage. (True or False) 4.Assume that we have a stack which can input and output data at both side (side 1 & 2), the order of input elements is :a.b.c.d,e, if we want to get the sequence a,c.b.d.e, we should execute as push(S.a,1), pop(S, 1), pop(S. 1), pop(S,1), push(S, e, 2), pop(S.2). 5. the digraph given by the figure. The two strongly connected components are 6. For a given binary tree, if its post-order traversal sequence is {6, 1, 2, 5, 3, 4 }, pre-order traversal sequence is {4, 2, 1, 6, 3, 5 } So its in order traversals is