I'm confused on the steps that need to be taken to solve this.

Let S = {0,1} and define a language L over as L = { 0'10"10":n> 1} Show that L is not context-free. Hint: Let p be the pumping constant and consider the string s = OP 10P 10P. Write s as in the Pumping Lemma. Either vy has no zeros, or it has at least one zero; consider these cases separately