Show that for $|\backslash$Sigma $|=1,$ the Post correspondence problem is decidable;

that is$,$ there is an algorithm that can decide whether or not $($A$,$ B$)$ has

a PC solution for any given $($A$,$ B$)$ on a single$-$letter alphabet.