An algorithm has been written to: - set 100 elements of the array Reading[1:100] to zero - input integer values between 1 and 100 - end the process with an input of -1 - reject all other values - count and output the number of times each value is input, starting with the largest value. (a)Complete the pseudocode algorithm: ``` FOR Count ← 1 TO .............................................................................................. Reading[Count] ← 0 NEXT Count OUTPUT "Please enter next reading " INPUT Value WHILE Value <> -1 DO IF Value <= 0 OR THEN OUTPUT "Reading out of range" ELSE Reading[Value] ← ............................................................................... ENDIF OUTPUT "Please enter next reading " 14 15 16 17 18 19 20 ``` ``` 01 02 03 04 05 06 07 08 09 10 11 12 13 .......................................................................................................................... ENDWHILE Count ← 100 REPEAT OUTPUT "There are ", " readings of ", Count Count ← UNTIL Count = 0 ``` (b) Describe how the algorithm could be changed so that it does not output any counts of zero. \_\_\_\_ \_\_\_\_ \_\_\_\_ \_\_\_\_ \_\_\_\_ \_\_\_\_

2022 - O/N - 0478/21 | Q2

0/5

0 correct · 0 wrong

An algorithm has been written to: - set 100 elements of ...