Using PYTHON, implement the following function (see image below for details):

max_new (xs,olds) given a list of integers xs, and a list of old integers olds, find and return the largest integer in xs that isn't also in olds. When there is no such number, return None >>> max_new([1,2,3,4,5,6],[5,6]) >>> max_new([1,5,3,4,6,2,4,4],[5,6]) # order doesn't matter. # make sure you handle negatives. >>> max_new([-5, -4, -3][-4]). -3 >>> ans = max_new ((1,1,1,1,1],[1]) >>> print (ans) None # long way to show that we got back a None