Given a positive integer N, you are asked to write the pseudo-code of an algorithm that finds all the factors of N i.e. values that divides N with zero remainder). Example: N= 12 + factors will be (1, 2, 3, 4, 6, 12) a. Design an iterative solution to the problem (i.e. using a for or while loop). b. Find the total number of operations (divisions, comparisons) performed in the iterative algorithm as a function of the value N. Suggest a solution to minimize the number of operations