Select the matching Big-O notation for each of these array-based List methods: is empty vindex remove insert contains- max intersection peek 2. O(log n) 3. O(n) 4. O(n log n) 5. O(n 2) find len count union vremove_many linear search clean identical min --getitem peek --getitem min insert binary search vmax vremove_many len 2. Ollog m) 3. O(n) 4. O(n log n) 5. O(n 2) intersection fined contains identical count emove is empty index clean union Select the matching Big-O notation for each of these array-based List methods: is empty vindex remove insert contains- max intersection peek 2. O(log n) 3. O(n) 4. O(n log n) 5. O(n 2) find len count union vremove_many linear search clean identical min --getitem peek --getitem min insert binary search vmax vremove_many len 2. Ollog m) 3. O(n) 4. O(n log n) 5. O(n 2) intersection fined contains identical count emove is empty index clean union