Given an unsorted array of n English words, each at most 7 letters long. You need to find the kth smallest with respect to lexicographic ordering element in this array. Show how to do it in linear time. Reminder of lexicographic order: Words are written in English alphabet. In addition to letters of English alphabet special symbol 'space (denoted ")' is assumed to be part of alphabet. In lexicographic order:• Letters of English alphabet are ordered from first to last with space being the smallest ε < a < b < c <... .,• Given two different sequences of the same length, a1, a2, . . . , at and b1, b2, . . . , bk, the first one is smaller than the second one for the lexicographical order, if ai < bi (for the order of A), for the first i where ai and bi differ.• A word cannot start with ε, but when comparing two English words of different length with respect to lexicographic order the shorter word is padded by necessary number of ε’s at the end to have the same length as the longer word.