InstructionsIn 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.

ow you have two sorting algorithms defined, in this task you should create a small program that asks the user which sorting algorithm they would like to use, then sort the lexicon with that sorting algorithm.You should ensure that you test both sorting algorithms to see they give you the same result. When you do this, ensure that you reinitialize your lexicon (Run Task 2 again) to ensure that your lexicon is not already sorted.Example RunsYou should replace the names of the sorting algorithms with the algorithms you have chosen.Note: You can assume the user input will always be either 1 or 2.Note: You can hardcode the names of the sorting algorithms you selected.Run 1:Select your sorting algorithm (1. Bubble Sort, 2. Selection Sort): 1Sorting with Bubble SortRun 2:Select your sorting algorithm (1. Bubble Sort, 2. Selection Sort): 2Sorting with Selection Sort

A dictionary contains words that are arranged in an … order.1 poinA. alphabetB. alphabetsC. alphabeticalD. alphabetically

From the assignment brief, along with the spelling of the word, a word in your lexicon needs to store the following information:The frequency: How many times the word appears in the input files.The list of neighbours: A neighbour of a word w is a word that is of the same length and differs from w by only one letter.The best way this can be implemented is as a Word class, where you can populate your lexicon with Word objects.Your task in this section is to create a class Word that is used to represent a Word in your lexicon.When you do this, you will need to:Think about what instance variables should be defined (and how they should be initialized)Think about what methods you need to implement for this classIn a future task, you will need to sort your lexicon full of Word objects. In the labs you saw a similar example where you needed to sort a collection of Person objects. It may be useful to refer back to this to see what methods were required.You may find that once you attempt the following tasks, you need to come back to this class and add additional methods.

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

Arrange the words given below as per order in the dictionary.A. Tout, B. Transfer, C. Torpor, D. Tenet, E. Toy