in c language

Your Task Write the following program: Input (from stdin): a string whose characters represent an alphabet Output (to stdout): all possible strings of length 3 that may be created from . In other words, you are computing the cartesian product xEx. Print strings one per line in any order (but there should be no duplicates). Add a target named run-hwo-alphabet to your Makefile that runs your solution. Example: printf "01" I make -sf Makefile run-hwe-alphabet Example output: 000 001 010 011 100 101 116 111