RESTRICTIONS: NO LOOPS , to be done in python 3. Can use recursion, abstract functions, basic operations

4.2 Intersection Size Write a function intersection_size(L1, L2) which consumes two lists of integers L1 and L2, and returns the number of common elements between the lists. If L1 contains exactly one instance of n and L2 contains multiple instances of n, 1 element is shared between the lists. If n occurs j times in L1 and k times in L2, the minimum of j and k elements are shared. This function does not need examples and tests. Sample: L1 = [1, 2, 3, 4, 5] L2 = [4, 2] L3 = [1, 2, 3, 4, 4, 5, 5] intersection_size (L1, L2) => 2 intersection_size (L1, L3) => 5