1 Let A and B be the students in two courses, where a student data contains name/id/GPA, and id is used as the key.

(a) (i) use unsorted array structure to find AUB, AB, A-B (implementation)

(ii) What is the time complexity for each of set operations, where |A| = n and |B| = m?

(b) (i) use the sorted array structure to find AUB, AB, A-B (implementation)

(ii) What is the time complexity for each of set operations, where |A| = n and |B| = m?

USE JAVA FOR CODING.