Question 1 1 pts The efficient steps to compute X128 is 6 multiplications 127 multiplications 64 mulitplications 7 multiplications Question 9 1 pts Compute values of Poland notation: 33 65 80 - 40 21 -, the answer is 6798 -882 128 1352 Question 11 1 pts The worst and best number of steps to access a tree of N nodes are o O(N), O(logN) O O(N), O(NlogN) O O(1), O(NN) O O(NN), O(N) Question 14 1 pts Computing an expression tree will take O preorder inorder postorder Question 15 1 pts Suppose T1(N) = O(f(n)) and T2=O(f(N)), then T1(N) = OCT2(N)) O T1(N) / T2(N) = (1) O T1(N) - T2(N) = n(f(N)) T1(N) - T2(N) = 0