C programming question with no io stream

Problem A: Square Letter Puzzles 2 You may remember the mobile puzzle game that Joe Coder was working on in Practicum 2: Each puzzle piece in his game consists of four letters aranged in a square, such as: AB CD He decided to use only uppercase letters and the underscore character in his puzzles. Addi tionally, he wants to arrange these puzzle pieces into larger square patterns. For example, if you we are given the following four pieces presented in a linear order: AB D_ CD BA he will need to rearrange them into a square pattern. However, these square patterns must be such that adjacent pieces must match horizontally and vertically. For example, the only way to arrange the above four pieces into such pattern is: AB BA CD D CD D You can notice that adjacent letters of the top pieces match (B and D), as well as the bottom pieces (D and X)The left-hand two pieces also match in their adjacent rows (C and D), and the right-hand pieces match in their adjacent letters (D and from the linear order into a squane Your task is to write a program for rearranging the pieces pattern, but you must find an arragement where the adjacent pieces are matching and print it. If it is not possible to find a solution, you must report that, or if there are more than one solution, then you must only report the number of solutions, i.c., number of ways the pieces can be arranged in a matching way Input The input consists of one or more test cases. Each test case starts with an integer n2 on a line > 0), which is the number of puzzle pieces. This is followed by two lines containing letters of the puzzle pieces. The first line contains top letters and the second line contains bottom letters of the pieces. Letters of one piece are separated from the letters of the next piece with one space character