TRUE/FALSE: (NEED ANSWERS ONLY) S 1. Given that the pushing sequence of a stack is {1, 2, ..., n} and popping sequence {X,X2, ***,Xn }. If x2=n, we can obtain 2 different possible popping sequences. a) True b) False In a Turnpike Reconstruction Problem, given distance set D = { 2, 2, 4, 6, 6, 8 }, x1~x4 = (0, 2, 6, 8 ) is the only solution provided that x1 = 0. a) True b) False (logN)3 is O(N). a) True b) False If the depth of an AVL tree with nodes {1, 2, 3, 4 } is 3 (the depth of the root is 1), then either node 2 or node 3 must have two children. a) True b) False If keys are pushed onto a stack in the order abode, then it's impossible to obtain the output sequence dabe. a) True b) False