The pseudocode of the figure below illustrates the basic push$()$ and pop$()$ operations of an array$-$based stack. Assuming that this algorithm could be used in a concurrent environment, answer the following questions

push$($item$)\{$

if $($top $$ SIZE$)\{$

stack$[$top$]=$ item;

top$++$;

$\}$

else

ERROR

$\}$

pop$()\{$

if $(!$is empty$())\{$

top$--$;

return stack$[$top$]$;

$\}$

else

ERROR

$\}$

is empty$()\{$

if $($top $==0)$

return true;

else

return false;

$\}$

A$)$ What data has race condition?

B$)$ How can the race condition be fixed?