Questica 1 Not yet answered Marked out of 1.00 What will be the Big-Oh complexity to traverse a linked list? Select one o a. on) O b. 0(1) Flag quastion O d. 0(2) reestica 2 Not yet answered Marked out of 1.00 What is the big-o complexity of the purple line? Select one o a. O(m) O b. O(log n) O c. O(n2) PFlag question Questicn 3 Not yat anawerad Marked out of 1.00 is the time complexity of an algorithm that operates in exponential time. This means that process times doubles with the addition of each data element. Select one O a. O(n) O b. o(log n) Flag question O d. 0(2) Ouestica 4 Not yet answered Maked out of 1.00 P Flag question If the characters "D', ,'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed? Select one O a. ABCD O b. ABDC O c. DCAB O d. DCBA O e. ACDB