Ask an expert:

Please help with the Python code:

a$)$Return a list or set containing all the factors of n$,$ excluding n but including $1.$ You may assume n is a positive integer.

def factorize$($n$)$:

assert type$($n$)$ is int

assert n $>0$

$1$ has no factors!

pass

b$)$Return a list consisting of K values of the Aliquot sequence for n$.$ This sequence is defined by A$\_\{$k$+1\}=$ sum$($ func$($A$\_\{$k$\})),$ where A$\_1=$ n$.$ If func$()$ isn't provided, it defaults to factorize$().$

def aliquot$\_$sequence$($n$,$ K$,$ func$=$factorize$)$:

assert type$($K$)$ is int

assert K $>0$

Pass

$$

c$)$ Return the Aliquot sequence for n$,$ up until the sequence repeats, using func$()$ for integer factorization. Do not include any repeated value.

def aliquot$\_$sequence$\_$unique$($n$,$ func$=$factorize$)$:

print$($ f'As a quick test, this code claims the Aliquot sequence for $12$ is $\{$aliquot$\_$unique$(12,$factorize$)\}.\text{'})$