Part of an algorithm processes data in two lists: list1 and list2. The algorithm returns a single list: newlist. The size of a list can change as items are added and removed from the list.List operations include:append: adds a new item to a list.len: returns the number of items in a list.The algorithm is shown below:01 function returnlist(list1,list2)02 newlist = []03 index1 = 004 index2 = 005 while index1 < list1.length and index2 < list2.length06 if list1[index1] > list2[index2] then07 newlist.append list2[index2]08 index2 = index2 + 109 elseif list1[index1] < list2[index2] then10 newlist.append list1[index1]11 index1 = index1 + 112 elseif list1[index1] == list2[index2] then13 newlist.append list1[index1]14 newlist.append list2[index2]15 index1 = index1 + 116 index2 = index2 + 117 endif18 if index1 < list1.length Then19 for item = index1 to list1.length20 newlist.append list1[item]21 next item22 elseif index2 < list2.length then23 for item = index2 to list2.length24 newlist.append list2[item]25 next item26 endif27 return newlistState three features of the program that aid maintainability of the code, and outline one additional feature of structured programming that could be used. Describe how the feature would improve maintainablity.

Match the term with its definition sizel() isEmpty() first() last() addFirst(e) addLast(e) removeFirst() removeLast() with Removes and returns the last element of the list. Adds a new element to the end of the list. Returns the number of elements in the list. Adds a new element to the front of the list. Removes and returns the first element of the list. Returns(but does not remove) the first element in the list. Returns (but does not remove) the last element in the list. Returns true if the list is empty, and false otherwise.

In which  sort algorithm divides the list into two parts, sorted and unsorted. Initially, the sorted part contains only one element. In each pass, one element from the unsorted list is inserted at its correct position in the sorted list. As a result, the sorted list grows by one element and the unsorted list shrinks by one element in each pass.

28. What is the purpose of the append() method in Python lists? A) To insert an element at a specific position in the list B) To remove the first occurrence of an element from the list C) To add an element to the end of the list D) To reverse the order of the elements in the list 29. Which of the following is the correct way to access the last element of a list in Python? A) list[-1] B) list[0] C) list[len(list)] D) list[1] 30. What is the main difference between a list and a tuple in Python? A) A list is mutable while a tuple is immutable B) A tuple is mutable while a list is immutable C) A list can contain elements of different data types while a tuple can only contain elements of the same data type D) A tuple can contain elements of different data types while a list can only contain elements of the same data type

7. Write a recursive algorithm that calculates and returns the length of a list.

1.Question 1What does the following function return: len(['A','B',1]) ?1 point3242.Question 2What does the following function return: len([sum([0,0,1])]) ?1 point1033.Question 3What is the value of list L after the following code segment is run :L=[1,3,2]sorted(L)1 pointL:[1,3,2]L:[1,2,3]L:[0,0,0]4.Question 4From the video what is the value of c after the following:c=add1(2)c=add1(10)1 point311145.Question 5what is the output of the following lines of code:def Print(A):    for a in A:     print(a+'1')Print(['a','b','c'])1 pointabca1b1c1a1