Searching maximum values in an unordered array is O 0(1) O O(n) o Oin2 O O(log n) QUESTION 2 When delete an item from an unordered array, in most cases you Move other items to downwards by position one. Move other items to upwards position by one. Delete an item without shift other items. None of the above QUESTION 3 Big O notation tells how the speed of an algorithm relates to the size of the memory of items. how the size of a data structure related to the number of items. the performance time of an algorithm for a given size data structure. None of the above