Given an array of size n$,$ let$$s assume an element is $$touched$$ if and only if some operation is performed on it$($for example, for performing a pop operation the top element is $$touched$).$ Now you need to perform Dequeue operation. Each element in the array is touched atleast?

Your answer:

Twice

Once

Thrice

Four timesAssume that a Stack is implemented in a class named "StackArray" with an integer array that has $10$ elements. What will be the array elements after the given code

is executed? $($Note that elements should be displayed starting from the top.$)$

StackArray stackArray $=$ new StackArray $(10)$;

for $($int $i=0$; $i<mn\; id="EditorElement\_311974">1</mn><mn\; id="EditorElement\_311975">0</mn><mn\; id="EditorElement\_311976">0</mn>$; i$++)\{$

stackArray.push$($i$)$;

$\}$

Your answer:

$\{1,2,3,4,5,6,7,8,9,10\}$

$\{10,9,8,7,6,5,4,3,2,1\}$

$\{0,1,2,3,4,5,6,7,8,9\}$

$\{9,8\mathrm{.}7,6,5,4,3,2,1,0\}$