Various Computer Science Statements - True or False with very brief explanation:-

Indicate whether each of the following statements is true or false. There is one mark for each correct answer and zero marks for each incorrect answer. Statement 1 n(n) 2 | 2.1 . n2.1 + 120n-0(n*) 3 School Integer Multiplication takes time e(n2). 4 The all-pairs shortest path problem is currently solvable on any graph in O(n) time. 5 It is known that there are problems in NP that are not in P Boolean Satisfiability Problem is NPH 7 Every problem that is NP-Hard is also known to be NP-Complete 8 AVL trees can degenerate to a worst case () time for find operation:s. 9 Dijkstra's single-source shortest path algorithm cannot work orn graphs containing negative-weight cycles. 10 Exponential search is useful when the length of its input list is not known