CS 100 Project Four - Spring 2018 files. The first file is all is program assumes that the text message logs maintained in your phone are stored in two separate the incoming text messages that you received, the second is all the outgoing text messages that you sent. This program reads these two files and prints your text message history in chronological order (oldest to newest) The program takes two command-line arguments that represent the log files for all incoming text messages and all outgoing text messages. A sample executionis: /a.out datafilel datafile2 he first day of school Page two contains a sample execution of the program. The two log files capture a conversation from t last August with you r mother. Look at the sample log files and the program execution before reading any further The format for these two log files is shown below: EPOCH-time> An EPOCH-time is an integer representing the number of seconds since January 1, 1970. 1519408800 translates to noon on Friday, February 23, 2018 (Central). To convert an EPOCH-time integer to a readable date, use the function shown below // this function takes an integer representing a time in seconds and // returns a formatted string (ending with a newline) containing the date char *readableTime (int sec) time-t epoch-time= (time_t) sec; return asctime localtime &epoch time) ) The website associated with any EPOCH-time allows you to generte te EPOCH-times for any date, and see the date Your program reads from two files and prints out the text message conversations in chronological order (from the oldest message sent/received to the newest). The required format for your output is: The first 25 characters on a line are a readable version of the EPOCH time. The function readable Time (shown e sure you remove this trailing above) has a newline character as the very last character of the string it generates. Mak newline character (simply replace it with a ' \0 ' character). The next field in the output lines is the phone number that texted you (or you texted). The text message itself is printed in a block that does not exceed 40 characters. If there are more than 40 characters in a text message, wrap the message to the next line. The basic algorithm for merging two files into a single output is shown below. For this project, you can assume that no two text messages will ever have the same timestamp