Number 1: a.) Come up with an efficient function that does compute the intersections of 2 int arrays that are sorted.

b.) Come up with an efficient function that does compute the intersections of 2 int arrays that are NOT necessarily sorted.

c.) Determine the time complexity (theta) for the above algorithm.