not allowed to use pumping lemma $(10$ marks$)$ The subset of HTML containing only the tags indicates the beginning of a

paragraph of text, and tags can be nested, example: $MD=(Q,,,s,F)Q$:$QQsF<mi\; id="EditorElement\_11616835">\backslash </mi>$p$><mi\; id="EditorElement\_11616839">\backslash </mi>$p$>).$ You may

assume there is no text content within paragraph tags.

Assume, for the sake of contradiction, that the given language is regular. This implies that there is a DFA M that

recognizes it$.$

let D$=($Q$,\backslash$Sigma $,\backslash$delta $,$s$,$F$)$ where:

Q is a finite set of states

$\backslash$Sigma is the alphabet $\{($:p:$),$

$\backslash$delta :Q$\backslash$times $\backslash$Sigma $->$Q is the delta transition function

s is the initial state

F is the set of accepting states