Write a Python function that proves this claim for all prime numbers $n$ less than $10.$ Your

program should check if $n$ is prime and if so$,$ output $n,$ pow $(2,n-1)($pow $(2,n)-1$ and

also all divisors of pow $(2,n-1)($pow $(2,n)-1$ to prove that pow $(2,n-1)($pow $(2,n)-$

$1)$ is a perfect number.