4. Step 1: get price

Step 2: multiply price with quantity.

Step 3: multiply total by 0.06

Step 4: Add previous to total price.

Stop

5. A: Divide x by y if y doesn’t equal zero, else display Unable to perform the division.

B: If r is greater than 1.o then multiply by (Pi)R2, else multiply R by 2 (Pi)

Stop

9: Step 1: get price

Step 2: multiply price with quantity.

Step 3: multiply total by 0.06

Step 4: Add previous to total price.

Step 5: keep adding the total until cost exceeds 1000$

Stop

14: Step 1: Arrange numbers in numerical order.

Step 2: Numericly assign each number a value.

Step 3: Calculate amount of numbers (N value)

Step 4: If N is even, than divide N total by 2. Make that Your median, else (if N is odd) then divide N value by 2 and round up.

Step 5: Given this number use it to choose from the value given in step 2.

Stop

17: A: If Ai was equal to the greatest value so far, orginially the action would not have been performed, however in the later situation the action would have been performed.

B: In every situation where Ai was greater than the largest so far you would not have continued with the command, and vice versa.

Your whole program can change and depends on typing the right command.