Write a simplified version of sort called my-sort-1 that reads from standard input, sorts lexicographically, and writes the output to standard output. For this program you may assume that the longest line has 1022 characters and that there are at most 4096 lines. Use an array of characters as a buffer to read a line. However, after you read a line, you must dynamically allocate a string of the right size to hold it (strdup). Use an array of strings to hold all of the lines. To sort the data, use qsort. Do NOT try to write a sort function!