Write a Python function named map that takes a positive integer n = d1d2d3

Write a Python function named map that takes a positive integer n = d1d2d3 ...dk ,whereO g dk g 9 is the ith digit of the number n and returns the smallest digit d,- that divides 12. If none of d,- divides 12 your function must return 0. For example, the number 375, consists of digits 3, 7 and 5, and only 3 and 5 divides 375. Therefore map(3'75) _, 3. Below you can find some more examples, 0 map(23} a map(34) a map(57} a map(12) a map(61) a map(22} q map(32} _, map(30) a map(33} a hwwMNl-'l-'DO map(48) s b. (5 points) What is the time complexity of your algorithm? You must explain your answer as in box below. 0. (15 points) Write a Python program that creates a list of integers of size 10, lst, and populates the list with randomly generated integers in range of [12, 61]. Then it sorts, in ascending order, the elements of lst according to the values obtained from the "map" functinn addition,