Question $3$

Develop well$-$documented pseudo code that finds all consecutive similar elements of a given array $($of

any size $n)$ by using either a stack or a queue. The code must display the start indices where the

values start to repeat, as well as the values of these elements. For instance, given the following array $A$ :

$(22,9,61,61,61,21,0,9,9,9,9,35,81,81,9,5,5),$ your code should find and display something

similar to the following $($notice that this is just an example. Your solution must not refer to this particular

example$)$:

Value $61$ is repeated $3$ times starting at Index $2$

Value $9$ is repeated $4$ times starting at Index $7$

Value $81$ is repeated $2$ times starting at Index $12$

Value $5$ is repeated $2$ times starting at Index $15$

a$)$ Briefly justify the motive$($s$)$ behind your design.

b$)$ What is the Big$-$O time complexity of your solution? Explain clearly how you obtained such

complexity.

c$)$ What is the Big$-$ time complexity of your solution? Explain clearly how you obtained such

complexity.

d$)$ What is the Big$-$O space complexity of your solution?