We have learned several different ways of implementing a collection of objects. Consider only the following collections in answering these questions. The collections are

i$.$ Sorted list implemented with an array

ii$.$ Unsorted list implemented with an array

iii. Heap implementation of a priority queue

iv$.$ Hash table

v$.$ Vector implemented with an array Find the worst case time to perform the following operations in each of the collections $($numbered i to v listed above$).$ Your answer can be one of the following O$(1)/$O$($log n$)/$O$($n$)/$O$($n log n$)/$O$($n $2)/$O$($n $3)/$O$(2$n $)$ isPresent: return the element depending on whether a particular object is a member of a collection $$ insert: add a new item to the collection.