3. You are given an array of strings of lowercase letters, where different strings may have different numbers of characters: let the total number of characters across all strings (NOT the total number of strings in the array) be n. Describe (in words, not pseudocode) a method to sort the array in standard alphabetical order. Then explain what the worst-case runtime of your algorithm is, in terms of only n, the total number of characters across all strings, and why that runtime is correct. Example: sorting the array ["cba", "b", "abc", "cb", "a"] would output ["a", "abc", "b", "cb", "cba"] and n=10 for this example. Hint 1: If you plan on using Radix Sort, how do you handle the fact that you might at some point be sorting strings based on the ith character, when not all strings in the array have at least i characters? Hint 2: When analyzing the runtime, consider the case where your array consists of one string of length (n/2), and (n/2) strings of length 1