Question $1$

a$)$ Given an unsorted array A of integers of any size, n $>=3,$ and an integer value x$,$ write an

algorithm as a pseudo code $($not a program!$)$ that would find out if there exist EXACTLY

$3$ occurrences in the array with value x$.$

b$)$ What is the time complexity of your algorithm, in terms of Big$-$O$?$

c$)$ What is the space complexity of your algorithm, in terms of Big$-$O$?$