Question: Consider two sets of integers, S = {s1, s2, ..., sm} and T = {t1, t2, ..., tn}, m = n.
(a) Propose an algorithm (only pseudo-code) that uses a hash table of size m to test whether S is a subset of T.
(b) What is the average running time complexity of your algorithm?