Pseudocode is a specific format for describing algorithms $($and is not a computer code$).$ You will understand that if you read the notes. All algorithms in the notes are written in pseudocode. If your pseudocode is not consistent with this format, you will lose points. Write an algorithm in pseudocode for computing and storing all the factors of a positive integer n$.$ Factors are all the positive integers between $1$ and n that evenly divide n $($with zero remainder$).$ First come up with at least two strategies for solving it and then pick the most efficient strategy $($one that needs fewest number of basic computational steps$)$ before writing the pseudocode. Please do not explain concepts that are already in the notes.

Describe the two strategies in as few and precise words as possible, much like I described the three strategies for the gcd problem. Then write the pseudo code for the strategy you selected. Please note that the pseudo code must follow the rules described in the notes. Using regular programming syntax that is not consistent with the pseudo code format is not allowed $($for a reason$).$