Python

Write a Python program that satisfies the following specification, def funyLst(L1, L2):""" L1 and L2 are lists of integers returns the element-wise product of L1 and L2. If the lists are of different length, it uses 1 for the missing coefficients. E.g., if L1 = [2, 2, 3] and L2 = [7, 5, 6, 7] it returns [14, 10, 18, 7] Write pseudo code for an exhaustive enumeration variant of guess and check. Give a concrete example and show the steps you will use to determine the computational complexity (of the real program)