Update docs/tutorials/grover_with_sampler.ipynb

Co-authored-by: Rebecca Dimock <66339736+beckykd@users.noreply.github.com>

docs/tutorials/grover_with_sampler.ipynb

@@ -19,7 +19,7 @@
     "\n",
     "Amplitude amplification is a general purpose quantum algorithm, or subroutine, that can be used to obtain a quadratic speedup over a handful of classical algorithms. [Grover’s algorithm](https://arxiv.org/abs/quant-ph/9605043) was the first to demonstrate this speedup on unstructured search problems. Formulating a Grover's search problem requires an oracle function that marks one or more computational basis states as the states we are interested in finding, and an amplification circuit that increases the amplitude of marked states, consequently suppressing the remaining states. \n",
     "\n",
-    "Here we demonstrate how to construct Grover oracles and make use of the `GroverOperator` from the Qiskit circuit library to easily setup a Grover's search instance. The runtime `Sampler` primitive allows for seamless execution of Grover circuits, including automatic compilation, error suppression, and readout error mitigation techniques."
+    "Here, we demonstrate how to construct Grover oracles and use the `GroverOperator` from the Qiskit circuit library to easily set up a Grover's search instance. The runtime `Sampler` primitive allows seamless execution of Grover circuits, including automatic compilation, error suppression, and readout error mitigation techniques."
    ]
   },
   {