Consider an array A of size n$.$ Each element is initially assigned

either $0$ or $1($you don$$t have to do that, it$$s already done$).$ Write a pseudo$-$

code for each one of the following functions:

$($a$)$ AddOne $($A$,$ n$)$: find the first $$zero$$ and change it to $$one$.$

$($b$)$ RemoveOne$($A$,$ n$)$: find the last $$one$$ and change it to $$zero$.$

$($c$)$ ShrinkArray$($A$,$ n$)$: Move all $$ones$$ to the front of the array, such that all

elements following the last $$one$$ are $$zero$$