Create a PDA that recognizes the following context free language with

terminals $\{$a$,$ b$\}$: L $=\{^+1^|>=1\}\backslash$cup $\{^^+2|>=1\}.$

$($i$)$ Describe your algorithm

$($ii$)$ Give the description as a complete $7-$tuple with a transition diagram