In C with comments and follow hints

Problem Given a list of newline-separated handles create an arrangement such that the following word begins with the same letter the prior word ended with. Input Input will begin with a line containing 1 integers, n (1 sns 12), representing the number of names to process. The following line will n space separated handles to use in the phrase. Each handle will be composed strictly of at most 20 lowercase Latin letters. Each handle will have at least one non-space character. Output Output should contain a pretty phrase composed of each of the given handles exactly once. It is guaranteed that at least one pretty phrase exists that uses all the given handles. Any pretty phrase will be accepted as long as all handles are used. Sample Input Sample Output 4 red dads seek karaoke seek red karaoke dads 2 desserts stressed stressed desserts Explanation Case 1 "red dads seek karaoke" is pretty because "red" ends with 'd', which "dads" begins with. "dads" ends with 's' which begins "seek". Lastly, "seek" ends with 'k' which is the same letter that "karaoke" begins with. Case 2 Either arrangement of stressed" and "desserts" is considered pretty. You could output "stressed desserts" or "desserts stressed". Hints Ugly Approach: We could loop over all the input words to figure out which first word we would use. We could then use a loop to figure out which word we want to use second. The second loop would need to be in the first to make sure that you are considering a valid word pairing. For every word position we would need a loop, but the loop would need to be in the loop of the prior word For ) For ) For ) For ) Recurse: We want to run these for loops within each other. We can create a nesting of for loops by calling a function recursively with in the for loop void f(N) For() f(N-1) Unrolling the above behavior we would see the same nested for loop behavior Returns: It's a good idea to return a value to represent if a pretty phrase has been found. Problem Given a list of newline-separated handles create an arrangement such that the following word begins with the same letter the prior word ended with. Input Input will begin with a line containing 1 integers, n (1 sns 12), representing the number of names to process. The following line will n space separated handles to use in the phrase. Each handle will be composed strictly of at most 20 lowercase Latin letters. Each handle will have at least one non-space character. Output Output should contain a pretty phrase composed of each of the given handles exactly once. It is guaranteed that at least one pretty phrase exists that uses all the given handles. Any pretty phrase will be accepted as long as all handles are used. Sample Input Sample Output 4 red dads seek karaoke seek red karaoke dads 2 desserts stressed stressed desserts Explanation Case 1 "red dads seek karaoke" is pretty because "red" ends with 'd', which "dads" begins with. "dads" ends with 's' which begins "seek". Lastly, "seek" ends with 'k' which is the same letter that "karaoke" begins with. Case 2 Either arrangement of stressed" and "desserts" is considered pretty. You could output "stressed desserts" or "desserts stressed". Hints Ugly Approach: We could loop over all the input words to figure out which first word we would use. We could then use a loop to figure out which word we want to use second. The second loop would need to be in the first to make sure that you are considering a valid word pairing. For every word position we would need a loop, but the loop would need to be in the loop of the prior word For ) For ) For ) For ) Recurse: We want to run these for loops within each other. We can create a nesting of for loops by calling a function recursively with in the for loop void f(N) For() f(N-1) Unrolling the above behavior we would see the same nested for loop behavior Returns: It's a good idea to return a value to represent if a pretty phrase has been found