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