<prompt> Ha u fuoa khoele ea ho kenya le bukantswe, theha tshebetso fumana lentswe le lelelele ka ho dikishinari e leng tatelano ya thapo e fanoeng.Khoele e kentsoeng: Bukana ea abppl: e khona, apole, sampole, abppl, pl  <response>: Instruction in English: Given an input string and a dictionary, create a function find longest word in dictionary that is a subsequence of the given string. . Response in English: Here is an example of function that could achieve the desired result in Python:pythondef find_longest_wordstring: str, dictionary: list - str: dictionary sorteddictionary, keylen, reverseTrue for word in dictionary: i 0 for s in string: if i lenword and s wordi: i 1 if i lenword: return word return Examplestring abpppldictionary able, apple, sample, abppl, plprintfind_longest_wordstring, dictionary abpplThe function takes two arguments, string which is a string, and dictionary which is a list. First, it sorts the dictionary in descending order of length. Next, for each word in the dictionary, it checks whether it is a subsequence of the input string. If it is, then that word is returned, otherwise, it returns an empty string. . Response in Sesotho: Mona ke mohlala oa tsebetso e ka fihlelang sephetho se lakatsehang Python: python def find_longest_wordstring: str, dictionary: list - str: dictionary hlophisoadictionary, keylen, reverseTrue bakeng sa lentsoe ho bukantswe: i 0 bakeng sa s moleng: haeba ke lenlentswe le s lentswei: i 1 haeba ke lenlentswe: kgutlisa lentswe Mohlala kgwele abppl dictionary able, apple, sample, abppl, pl printfind_longest_wordstring, dictionary apppl Mosebetsi o nka likhang tse peli, string e leng khoele, le dictionary e leng lethathamo. Ea pele, e hlophisa bukantswe ka tatellano e theohang ya bolelele. Ka mora moo, bakeng sa lentsoe le leng le le leng bukeng e hlalosang mantsoe, e hlahloba hore na ke tatelano ea khoele ea ho kenya. Haeba ho joalo, joale lentsoe leo lea khutlisoa, ho seng joalo, le khutlisetsa khoele e se nang letho. 