You are an editorial staff working for Miriam Webster Dictionary. Your job is to quickly sort out new words by their prefixes and incorporate them into the dictionary for publication this year. Given that there are more than several thousands new words to sort out, you decide to write a program to do the job for you. A prefix is the beginning series of characters in an English word. Example, "un" is a prefix for "unhappy", "flow" is a prefix for "flower", etc. Write a Solution class with the following method to find the largest common prefix denominator in an array of English words. class Solution { // YOUR STYLING DOCUMENTATION HERE public String getLargestPrefix(String[] words) { // YOUR CODE HERE Your .java file structure may look like: public class HomeworkAssignment2_2 { public static void main(String args[]) { Solution sol = new Solution; String[] words = {"a", "b", "c"}; System. out. println(sol. getLargestPrefix(words)); class Solution { // YOUR STYLING DOCUMENTATION HERE public String getLargestPrefix(String[] words) { // YOUR CODE HERE EXAMPLES Input: ["los","las","let"] Output: "T" Input: ["ate","cate","kate"] Output:"" Explanation: there is no common prefix. Note "ate" is not a common prefix in the array; "ate" is considered a suffix. Input: ["cate","cat","category"] Output: "cat" Input:["abas","dca","tie"] Output:"" Explanation: there is no common prefix in the array. CONSTRAINTS/ASSUMPTIONS • The array consists of anywhere from 1 to 50 English words. • All English words are in lower case. • Words are not empty. • If there is no common prefix, return an empty string "").