(Solved): Write an algorithm for questions 2 and 4. The first image shows how the algorithm should be structur ...

Write an algorithm for questions 2 and 4. The first image shows how the algorithm should be structured.

1. Other algorithms are possible. \{integer, integer, integer, integer\} change (real price) amount \( =1,0- \) price \( q=0 \) while amount \( \geq .25 \) \( \quad q=q+1 \) amount \( = \) amount \( -.25 \) \( d=0 \) while amount \( \geq .10 \) \( \quad d=d+1 \) amount \( = \) amount \( -.10 \) \( n=0 \) while amount \( \geq .05 \) \( n=n+1 \) amount \( = \) amount \( -.05 \) \( p= \) return \( \{q, d, \quad n, p\} \) end change 2. Write an algorithm that makes change for a purchase. The algorithm should return a set containing the number of quarters, dimes, nickels, and pennies to return (in that order). The return set should be declared as \{integer, integer, integer, integer\}. You may assume that the customer does not pay less than the price. Use as many quarters as necessary. 4. Write an algorithm that determines how many positive integers evenly divide the positive integer \( n \). The algorithm should return the number of divisors (not the actual divisors). For example, 4 has three divisors: 1,2 , 4. Call the algorithm numberofdivisors.