Question 13 Not yet answered Marked out of 1.00 True/False: O(1) is the time complexity of an algorithm that operates in constant time. The process time required stays constant regardless of the data size. Select one O True O False Flag question Queation 14 Not yet answered Markad out of 1.00 P Fleg question is the time complexity of an algonthm that operates in linear time. The process time changes in the same ratio as the data size Select one O a O(n) O b.0(1) c. O(m) Question 15 Not yet answered Marked out ot 1.00 P Flag question What will be the Big-Oh complexity to search a balanced binary tree? Select one O a. o(n) O b. O(log n) O d o(2 Question 16 Not yat anawarad Marked out of 1.00 What will be the Big-Oh complexity of a linear search? Select one O a. o(n) O b. 0(1) O c. O(n2) Flag