Please perform below $4$ steps to solve the task:

$1.$ Read the problem statement.

$2.$ Formulate the algorithm using pseudocode and top$-$down, stepwise refinement.

$3.$ Write a C program.

$4.$ Test, debug and execute the C program

Task: An integer number is said to be a perfect number if its factors, including $1($but not the number itself$),$ sum to the number. For example, $6$ is a perfect number because $6=1+2+3.$ Write a function isPerfect that determines whether parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between $1$ and $1000.$ Print the factors of each perfect number to confirm that the number is indeed perfect.