Consider the unary alphabet sigma_1 = {0}. Show that for dominos constructed with strings of the unary alphabet, Post-Correspondence Problem is decidable. That is, give an algorithm to solve the PCP when the top and the bottom strings of each of the domino are strings in {0}* (note that this also includes the empty string elementof)