Write a function named lengthSort that sorts an array of strings from shortest to longest. Each element of the array is a pointer (char *). If two strings are of equal length, then they are sorted according to alphabetical order. (Case matters.) void lengthSort(char * a[], int n); Examples: "fox" comes before "foxes" because it's shorter. "foxes" comes before "goofy" because they are the same length, and "foxes" is alpabetically first. Standard library string functions may be used.

ALL THAT IS REQUIRED IS THE void lengthSort(char * a[], int n); FUNCTION

----------------------

We use the following struct to represent a time of day: struct time { int hours; /* 1 - 12 */ int mins; /* 0 - 59 */ int pm; /* 0 if AM, 1 if PM */ }; Write a function named lessThan that takes two read-only pointers to times and returns 1 if the first time is less than (earlier than) the second, and 0 otherwise. Assume that both times are on the same day. Midnight (12:00am) is the earliest time of the day, and 11:59pm is the latest. Noon is 12:00pm.

ALL THAT IS REQUIRED IS THE lessthan FUNCTION