Both Questions 1 and 2 refer to the following algorithm:

x = 0

y = 0

DOWHILE x < 2

   DOWHILE y < 2

      y = y + 1

      Print y

   ENDDO

   x = x + 1

   Print x

ENDDO

1. How many numbers will be printed out after executing the above algorithm?

A             2

B             3

C             4

D             6

E              8

2. What is the fourth number to be printed out?

A             1

B             2

C             3

D             4

E              5

3. How many subscripts does a three-dimensional array require?

4. To validate an input product code, an array of 100 product codes is to be searched. Which type of search will be the most efficient?