Consider a $3$ qubit Grover's search algorithm.

$1.$ What is the number of qubits in the output?

$2.$ How many different numbers can be fed to the the algorithm?

$3.$ What is the size of matrix associated with the oracle?

$4.$ What is the size of matrix associated with the diffusion operator?

$5.$ What is the optimum number of steps for the algorithm?

Let's assume the solution for the $3-$qubit search is $6.$

$6.$ What is the content of the matrix associated with the oracle?

$7.$ What is the content of matrix associated with the diffusion operator?

$8.$ Implement the search for this solution using Strange, and render the circuit.