Given one color $($W$/$B$/$Y$/$R$/$BL$,$ or G$),$ design an efficient algorithm to determine the

location $($array index$)$ of the first and last occurrence of that color ball shows inside array A$.$ For

example, for the following array A$,$ if given color is $$Y$($Yellow$),$ your algorithm should return

index $13$ and $18$ respectively. Write your algorithm in pseudo$-$code as shows inside your

textbook.

$1234567891011121314151617181920$

B B B R R R R R G G G BL Y Y Y Y Y Y W W