Consider a list (list = []). You can perform the following commands:insert i e: Insert integer at position .print: Print the list.remove e: Delete the first occurrence of integer .append e: Insert integer at the end of the list.sort: Sort the list.pop: Pop the last element from the list.reverse: Reverse the list.Initialize your list and read in the value of followed by lines of commands where each command will be of the types listed above. Iterate through each command in order and perform the corresponding operation on your list.Example: Append to the list, .: Append to the list, .: Insert at index , .: Print the array.Output:

my_array = [64, 34, 25, 12, 22, 11, 90, 5]n = len(my_array)for i in range(1,n): insert_index = i current_value = my_array.pop(i) for j in range(i-1, -1, -1): if my_array[j] > current_value: insert_index = j my_array.insert(insert_index, current_value)print("Sorted array:", my_array)

Just like strings, the list data type has several useful methods. For example, read help(list.append), help(list.insert) and help(list.extend) to see the documentation of some of the methods that modify lists. Modifying methods and operations for mutable sequence types (i.e., list) are summarised in this section of the python documentation.Below is an attempt to write a function, make_list_of_lists, that creates a list of n lists of increasing ranges of integers. The first entry in the returned list should be an empty list, the second a list of length one, ending with the number 1, and so on. For example, make_list_of_lists(3) should return [ [], [1], [1, 2] ]. (Note that n must be a non-negative integer.) However, this function is incorrect. Locate the error in the function and fix it so it works.The required output is:[][[]][[], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4]]Your code1def make_list_of_lists(n):2 the_list = []3 sublist = []4 while n > 0:5 the_list.append(sublist)6 sublist.append(len(sublist) + 1)7 n = n - 18 return the_list

Write a class MyList that inherits from list:Public instance method: def print_sorted(self): that prints the list, but sorted (ascending sort)You can assume that all the elements of the list will be of type intYou are not allowed to import any moduleguillaume@ubuntu:~/0x0A$ cat 1-main.py#!/usr/bin/python3MyList = __import__('1-my_list').MyListmy_list = MyList()my_list.append(1)my_list.append(4)my_list.append(2)my_list.append(3)my_list.append(5)print(my_list)my_list.print_sorted()print(my_list)guillaume@ubuntu:~/0x0A$ ./1-main.py[1, 4, 2, 3, 5][1, 2, 3, 4, 5][1, 4, 2, 3, 5]guillaume@ubuntu:~/0x0A$

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted. A. insertion sort B. merge sort C. bubble sort D. quick sort E. selection sort

Write program to perform INSERT_FIRST (to insert a node at the first position) andREVERSE_TRAVERSE (to display the data in nodes in reverse order) operations indoubly linked list