2) Coding exercises. Write pseudocode segments in the style of Cheney and Kincaid to solve the following problems: a) Assuming an integer variable n has already been initialized, output the integer prime numbers between 2 and n, inclusive. Y ou may assume that the value initialized in n is greater than 2. Make use of a special arithmetic operator, the modulo operator %, in your pseudocode. The modulo operator results in the remainder of an integer division operation. For example, 7 % 3-1, 10 % 4-2, and 12 % 6-0