C program

A suffix tree is a data structure that holds representations of all the suffixes of a particular string. For example, "computer" has eight suffixes, "computer", "omputer", ..., "ter" "er", "". Suffix tree data structures are used extensively in DNA analysis and other pattern matching algorithms. For this exercise, we will not be generating an actual suffix tree. Rather, we will simply write a recursive function that, given a string outputs all the suffixes. Your program should take a string from the command line and produce a list of suffixes, one per line. An example run