a) Suppose that a binomial heap H has a total of n nodes. The maximum number of binomial trees H can contain is the following: a) floor(log n) + 1 b) floor(n log n) c) floor(log n) 1 d) floor(log n) b) In the lecture we discussed the runtime complexity of Dijkstras algorithm when its implemented using a binary heap. What would be the algorithm runtime complexity if we replace a binary heap by a Fibonacci heap? Select the tightest upper bound. a) O((E + V ) log V )) b) O(E + V ) c) O(V + E log V ) d) O(E + V log V ) c) The solution to the recurrence relation T(n) = 8T(n/4)+O(n log n) by the Master theorem is: a) (n 2 ) b) (n 2 log n) c) (n log n) d) (n log2 n) B0B95AC7-7752-46B2-BAD2-FE0E1129D158 csci-570-sp-23-midterm-1 #13 Page 3 of 14 d) Analyze the worst-case complexity of the following code snippet and select the tightest upper bound. for(int i = 1; i < n; i++) for(int j = 1; j < i; j++) j = j * 2; a) O(n) b) O(log n) c) O(n 2 ) d) O(n log(n)) e) Analyze the worst-case complexity of the following code snippet and select the tightest upper bound. while(n > 0){ for(int i = 0; i