Lexicographical order is often known as alphabetical order when dealing with strings. A string is greater than another string if it comes later in a lexicographically sorted list.Given a word, create a new word by swapping some or all of its characters. This new word must meet two criteria:It must be greater than the original wordIt must be the smallest word that meets the first conditionExampleThe next largest word is .Complete the function biggerIsGreater below to create and return the new string meeting the criteria. If it is not possible, return no answer.Function DescriptionComplete the biggerIsGreater function in the editor below.biggerIsGreater has the following parameter(s):string w: a wordReturns- string: the smallest lexicographically higher string possible or no answerInput FormatThe first line of input contains , the number of test cases.Each of the next lines contains .Constraints will contain only letters in the range ascii[a..z].Sample Input 05abbbhefgdhckdkhcSample Output 0bano answerhegfdhkchcdkExplanation 0Test case 1:ba is the only string which can be made by rearranging ab. It is greater.Test case 2:It is not possible to rearrange bb and get a greater string.Test case 3:hegf is the next string greater than hefg.Test case 4:dhkc is the next string greater than dhck.Test case 5:hcdk is the next string greater than dkhc.Sample Input 16lmnodcbadcbbabdcabcdfedcbabcdSample Output 1lmonno answerno answeracbdabdcfedcbabdc

We define the following terms:Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows:For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball.A substring of a string is a contiguous block of characters in the string. For example, the substrings of abc are a, b, c, ab, bc, and abc.Given a string, , and an integer, , complete the function so that it finds the lexicographically smallest and largest substrings of length .Function DescriptionComplete the getSmallestAndLargest function in the editor below.getSmallestAndLargest has the following parameters:string s: a stringint k: the length of the substrings to findReturnsstring: the string ' + "\n" + ' where and are the two substringsInput FormatThe first line contains a string denoting .The second line contains an integer denoting .Constraints consists of English alphabetic letters only (i.e., [a-zA-Z]).Sample Input 0welcometojava3Sample Output 0avawel

What we call it writing numbers starting from smallest to the largest?a.Constant orderb.Descending orderc.Increasing orderd.Decreasing order

In this task, you should define two sorting algorithms that you can use to sort your lexicon of words. In the next task you will write a short program to use one of the sorting algorithms to sort your lexicon. Following sorting, words in your lexicon should be sorted in alphabetical order.It is entirely up to you which two sorting algorithms you include, as long as they are in the subject and different regarding time complexity.You should write one function per-sorting algorithm. Each of these functions should take a single parameter, the lexicon to be sorted. They should sort the lexicon in-place, so they do not need to return anything.

In a given sentence or an array of characters, reverse the order of words.

program must accept two string values S1 (may contain space) and S2 (one word) as the input. The words in S1 are sorted lexicographically and separated by exactly one space. The program must insert the the string S2 in S1 such that all the words in the modified S1 are also in sorted order.Note: The string values contain only lower case alphabetsBoundary Condition(s):1 <= Length of S1 <= 10001 <= Length of S2 <= 100Input Format:The first line contains S1.The second line contains S2.Output Format:The first line contains the modified S1.Example Input/Output 1:Input:abacus ball dog hat mind zebrainkOutput:abacus ball dog hat ink mind zebraExample Input/Output 2:Input:captain celbrate cricketcrackerOutput:captain celbrate cracker cricket