please help me with this two problems as they are related. thank you so much

1. Describe an implementation for a function that takes two sets, A and B, of integers and returns the set A B. Your algorithm must run in (A + B) average time, and you may not assume anything about the range of the integers. You may make the simple uniform hashing assumption (SUHA), as discussed at the beginning of the 1/29 lecture. Hint: Use a hash table. Assume the hash table has a load factor of. You will have to set the number of buckets high enough to avoid rehashing, in order to achieve the desired runtime. 2. If you knew that A and B each only contained integers between 1 and 30, and if you knew that JA