write a python code which can make the same output as the image

A pair of natural numbers (p, q) is a Betrothed pair if: - the sum of the proper divisors of p is one more than q - the sum of the proper divisors of q is one more than p For instance, (48, 75) is a Betrothed pair since - the proper divisors of 48 are 1, 2, 3, 4, 6, 8, 12, 16 and 24 - the proper -12 3 4 68121624-76 -13 51525-49 of 75 are 1, 3, 5, 15 and 25 Won't be tested for n greater than 10_000 The least number 0 that is the first member of a Betrothed pair is 48 The Betrothed pair itself is (48, 75) >>f (50) The least number > 50 that is the first member of a Betrothed pair is 75 The Betrothed pair itself is (75, 48) f (100) The least number > 100 that is the first member of a Betrothed pair is 140 The Betrothed pair itself is (140, 195)