Suppose you are given a lengthN sequence from a quaternary alphabet source S $=\{$a$,$b$,$c$,$d$\}$

generated with the following apriori probabilities Pr$($a$)=0\mathrm{.}2,$Pr$($b$)=0\mathrm{.}3,$Pr$($c$)=0\mathrm{.}1.$The generated

symbols are all statistically independent. Generate an instance of a random sequence of length $10$using

this distribution. Setup the Grover algorithm on a Qiskit to search for the number of occurrences of each

of the symbols. Can you empirically compute the apriori probabilities the quantum way from the devised

engine by running, say $100$trials$?$ You must provide all the details about the number Grover iterations, gate

complexity of your circuit, etc. Include all the details of the code in an Appendix