can someone explain why 6-9 are those time complexities

6. Suppose we implemented a set collection in a class named Arrayset that used an array as the storage data structure. Suppose also that we maintained the array in ascending natural order of its element.s. s Assurme that in the call s1.equals (s2) both sl and s2 are instances of the ArraySet clas each contain N elements. What is the best big-oh time complexity that the equals method coud 1 n f no class and achieve? o(N) c) O(N log N) (d) o(N2) . Suppose we implemented a set collection in a class named ArraySet that used an array as the storage data structure. Suppose also that we did not keep the elements of the array in any particular order Assume that in the call sl weersz path Tmd-s2 nrerrettmesortheAr ray set class and eacn contanclements. What is the best big-oh time complexity that the equals method could achieve? (a) o1) (b) O(N) et in order (c) O(N log N) 8. Suppose we implemented a set collection in a class named LinkedSet that used a singly-linked list \ of nodes as the storage data structure. Suppose also that we maintained the linked let in ascending natural order of its elements. Assume that in the call s1.equals (s2) both s1 and s2 are instances of the LinkedSet class and each contain N elements. What is the best big-oh time complexity that the equals method could achieve? (c) (d) O(NlogN) O(N2) 9. Suppose we implemented a set collection in a class named Linkedset that used a singly-linked list of nodes as the storage data structure. Suppose also that we did not keep the elements of the linked list in any particular order. Assume that in the call s1.equals (s2) both s1 and s2 are instances of the Linkedset class and each contain N elements. What is the best big-oh time complexity that the equals method could achieve? (b) O(N) O(N log N)