Answer :
Answer:
O(1) is the order of growth execution time of the add operation when using the ArrayCollection class, assuming a collection size of N.
O(1) is the order of growth execution time of the size operation when using the SortedArrayCollection class, assuming a collection size of N.
O(1) is the order of growth execution time of the remove operation when using the LinkedCollection class, assuming a collection size of N.
O(N) is the order of growth execution time of the remove operation when using the ArrayCollection class, assuming a collection size of N.
O(N) is the order of growth execution time of the contains operation when using the ArrayCollection class, assuming a collection size of N.