(Choose 1 answer)
Consider the following pseudocode:
0
1
2
3
4
5
declare a queue of characters, which is implemented by circular array of size 6.
(1)
while(there are more characters in the word to read)
i
n
g
{read a character
if a character is '*' then dequeue the queue
0
else
1
2
3
4
5
enqueue the character into the queue
(2)
} How the queue looks like after processing the input "Goo**dMor****ning**"?
i
n
g
A. (3)
(3)
0
1
2
3
4
5
Β. (1)
i
n
g
C. (2)
D. (4)
(4)
0
1
2
3
4
5
i
n
g
