Without using the compareTo method. Pseudocode is fine.

Suppose we have n strings of characters (from the 26-letter English alphabet). The lengths of the strings are 4.4, . . . In- 1. For m = lit 12+ . . . In, show how to sort the strings lexicographically in time 0(m). (For reference, here's an example of 6 strings sorted lexicographically: "a"