A city college is forming a football team to play in the upcoming district-level tournament. Two professors have been involved in this task. Due to a lack of communication and coordination, they ended-up forming two different groups. It created an issue. Hence, the principal decided to form a single team by identifying both groups' best talents. The principal needs your help to determine the duplicate members in these two groups The groups created by professors say S= (A1, A2,... Am) and T = (B1,B2, ... Be) where mos a. Write a pseudocode that uses a hash table of size 'm' to test whether S is a subset of T. 3 Marks b. What is the average running time of your algorithm? [3 Marks)