73. Introduction M and N are an amicable pair when (1) M are not equal to N ; (2) the sum of the divisors of M (excluding M itself) is equal to N ; and (3) the sum of the divisors of N (excluding N itself) is equal to M . T he smallest amicable pair is M = 220 , N = 284 . They are amicable because the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110, of which the sum is 284; and the proper divisors of 284 are 1, 2, 4, 71 and 142, of which the sum is 220. The first ten amicable pairs are: (220, 284), (1184, 1210), (2620, 2924), (5020, 5564), (6232, 6368), (10744, 10856), (12285, 14595), (17296, 18416), (63020, 76084), and (66928, 66992). By 1946 there were 390 known pairs, but the advent of computers has allowed the discovery of many thousands since then. Exhaustive searches have been carried out to find all pairs less than a given bound, this bound being extended from 108 in 1970, to 1010 in 1986, 1011 in 1993, and to 1017 in 2015. As of April 2016, there are over 1,000,000,000 known amicable pairs. Taken from https://en.wikipedia.org/wiki/Amicable_numbers on June 21, 2016). Find the 11 th amicable pair, then output the amicable pair, the number of pairs tried, and the elapsed time measured in seconds. I need it in python