title: Find all possible combinations of letters from two "alphabets" for any given word
body: <p>I got these two arrays of &quot;alphabets&quot;:</p>
  <pre><code>private static final char[] regularAlphabet = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z' };
  private static final char[] secondAlphabet = {'ᴀ', 'ʙ', 'ᴄ', 'ᴅ', 'ᴇ', 'ꜰ', 'ɢ', 'ʜ', 'ɪ', 'ᴊ', 'ᴋ', 'ʟ', 'ᴍ', 'ɴ', 'ᴏ', 'ᴘ', 'q', 'ʀ', 'ꜱ', 'ᴛ', 'ᴜ', 'ᴠ', 'ᴡ', 'x', 'ʏ', 'ᴢ' };
  </code></pre>
  <p>secondAlphabet uses special characters so they are read differently to regular ones.</p>
  <p>What I intend to do is print all the possible combinations that could be done for a given string. For example, given the String &quot;ab&quot; we can get: <code>ab, ᴀb, aʙ, ᴀʙ</code> (mind the difference in the characters pulled from each &quot;alphabet&quot;).</p>
  <p>The word will stay the same so the letters would not be rearranged, it's just about finding every possible mix between these types of letters for that word. Also, using methods such as toUpperCase wouldn't work cause I need to use these special characters found in secondArray.</p>
  <p>What kind of loop would I need to find a solution?</p>