Q:

Write a Brute force algorithm to find all the common elements in two lists of integer numbers. $($e$.$g$.,$ the output for the lists $1,3,4,7$ and $1,2,3,4,5,6$ should be $1,3,4).$ Show the time complexity of the algorithm if the lengths of the two given lists are $m$ and $n,$ respectively.