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 note: Describe the two strategies in as few and precise words as possible