The code does not pass the test cases. When n = 10000, there should be 5 pairs, but the answer in the code gives 4.

Find the sum of factors, except the number itself (also called proper divisors) 220=1+2+4+5+10+11+20+44+55+110=284 Now find the sum of factors for 284 284=1+2+4+71+142=220 220 and 284 are called the Pairs Write a Python program that 1. prints all the pairs 2 . number of steps took to compute pairs \#\# s = Solution(n,a) \#\#All action happens here \#\# a[0]= How many pairs are there in n. Use _increment_number_of_pairs to fill \#\# a[1]= num_steps . Use_increment_steps class Solution: def _init_(self, n: 'int', a:'list of size 2 ): self._ n=n \#\# s = Solution(n,a) \#\#All action happens here \#\# a[0] = How many pairs are there in n. Use _increment_number_of_pairs to fill \#\# a[1] = num_steps Use_increment_steps self._list =a \#\# You can have any number of data structures here self._u = Util() \#\# Nothing can be changed below self._alg() def_increment_steps(self)->'none': self._list[1] = self._list[1] + 1 def_increment_number_of_pairs(self)->"int": self._list [0]= self._list [0]+1 return (self._list[0]) \#\#You can have any number of private variables and functions def_alg(self): print("Code") print("Use as many small functions as possible") \# Implement your code here