choose the right answer

Question B28 For the bubble sort algorithm, what is the time complexity of the best/worst case? (assume that the computation stops as soon as there are no more swaps in one pass) a) b) c) d) best case: O(n) worst case: O(n) best case: Oin) worst case: O(n log(n)) best case: Oin log(n)) worst case: O(n log(n)) best case: O(n log(n)) worst case: O(n) Question B29 Which of the following problems is NOT a NP-problem? a) b) The travelling salesman problem Finding the shortest common superstring Checking whether two finite automata accept the same language Finding the square root of a very large number c) d)