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

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.

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

Sorting algorithms can be compared based on the number of comparison statements they make.Group of answer choicesTrueFalse

wo words are anagrams if you can rearrange the letters from one to spell the other. For example, `'hello'` and `'olleh'` are anagrams. You are to write a function called `isAnagram1` which takes two strings and returns `True` if they are anagrams. You can assume that the strings are made up of lowercase alphabets. `isAnagram1` should make use of the `sorted` function.

The basic operation in sorting problem is