let list=1200 element. Note: java programmimg, use given code. 3a. Use the binary search  3b. Use the sequential search  Print the number of comparison in step 3(a) and 3(b). If the item is found in the list, print its position. import java.util.*; public class Problem5 { staticScannerconsole = newScanner(System.in); finalstaticintSIZE = 1000; publicstaticvoidmain(String[] args) { Integer[] intList = newInteger[SIZE]; SearchSortAlgorithms intSearchObject = new SearchSortAlgorithms(); //code }         public interface SearchSortADT { publicintseqSearch(T[] list, intstart, intlength, TsearchItem); publicintbinarySearch(T[] list, intstart, intlength, TsearchItem); publicvoidbubbleSort(Tlist[], intlength); publicvoidselectionSort(T[] list, intlength); publicvoidinsertionSort(T[] list, intlength); publicvoidquickSort(T[] list, intlength); publicvoidheapSort(T[] list, intlength); }       public class SearchSortAlgorithms implements SearchSortADT{ privateintcomparisons; publicintnoOfComparisons(){ // finishthis  } publicvoidinitializeNoOfComparisons() { //code } publicintseqSearch(T[] list, intstart, intlength, TsearchItem) { intloc; booleanfound = false; for (loc = start; loc < length; loc++) { if (list[loc].equals(searchItem)) { found = true; break; } } if (found) return loc; else return -1; } publicintbinarySearch(T[] list, intstart, intlength, TsearchItem) { intfirst = start; intlast = length - 1; intmid = -1; booleanfound = false; while (first <= last && !found) { mid = (first + last) / 2; Comparable compElem = (Comparable) list[mid]; if (compElem.compareTo(searchItem) == 0) found = true; else { if (compElem.compareTo(searchItem) > 0) last = mid - 1; else first = mid + 1; } } if (found) return mid; else return -1; } publicintbinSeqSearch15(T[] list, intstart, intlength, TsearchItem) { intfirst = 0; intlast = length - 1; intmid = -1; booleanfound = false; while (last - first > 15 && !found) { mid = (first + last) / 2; Comparable compElem = (Comparable) list[mid]; comparisons++; if (compElem.compareTo(searchItem) ==0) found = true; else { if (compElem.compareTo(searchItem) > 0) last = mid - 1; else first = mid + 1; } } if (found) return mid; else returnseqSearch(list, first, last, searchItem); } publicvoidbubbleSort(Tlist[], intlength) { for (intiteration = 1; iteration < length; iteration++) { for (intindex = 0; index < length - iteration; index++) { Comparable compElem = (Comparable) list[index]; if (compElem.compareTo(list[index + 1]) > 0) { Ttemp = list[index]; list[index] = list[index + 1]; list[index + 1] = temp; } } } } publicvoidselectionSort(T[] list, intlength) { for (intindex = 0; index < length - 1; index++) { intminIndex = minLocation(list, index, length - 1); swap(list, index, minIndex); } } privateintminLocation(T[] list, intfirst, intlast) { intminIndex = first; for (intloc = first + 1; loc <= last; loc++) { Comparable compElem = (Comparable) list[loc]; if (compElem.compareTo(list[minIndex]) < 0) minIndex = loc; } return minIndex; } privatevoidswap(T[] list, intfirst, intsecond) { Ttemp; temp = list[first]; list[first] = list[second]; list[second] = temp; } publicvoidinsertionSort(T[] list, intlength) { for (intfirstOutOfOrder = 1; firstOutOfOrder < length; firstOutOfOrder ++) { Comparable compElem = (Comparable) list[firstOutOfOrder]; if (compElem.compareTo(list[firstOutOfOrder - 1]) < 0) { Comparable temp = (Comparable) list[firstOutOfOrder]; intlocation = firstOutOfOrder; do { list[location] = list[location - 1]; location--; } while (location > 0 && temp.compareTo(list[location - 1]) < 0); list[location] = (T) temp; } } } publicvoidquickSort(T[] list, intlength) { recQuickSort(list, 0, length - 1); } privateintpartition(T[] list, intfirst, intlast) { Tpivot; intsmallIndex; swap(list, first, (first + last) / 2); pivot = list[first]; smallIndex = first; for (intindex = first + 1; index <= last; index++) { Comparable compElem = (Comparable) list[index]; if (compElem.compareTo(pivot) < 0) { smallIndex++; swap(list, smallIndex, index); } } swap(list, first, smallIndex); return smallIndex; } privatevoidrecQuickSort(T[] list, intfirst, intlast) { if (first < last) { intpivotLocation = partition(list, first, last); recQuickSort(list, first, pivotLocation - 1); recQuickSort(list, pivotLocation + 1, last); } } publicvoidheapSort(T[] list, intlength) { buildHeap(list, length); for (intlastOutOfOrder = length - 1; lastOutOfOrder >= 0; lastOutOfOrder--) { Ttemp = list[lastOutOfOrder]; list[lastOutOfOrder] = list[0]; list[0] = temp; heapify(list, 0, lastOutOfOrder - 1); } } privatevoidheapify(T[] list, intlow, inthigh) { intlargeIndex; Comparable temp = (Comparable) list[low]; largeIndex = 2 * low + 1; while (largeIndex <= high) { if (largeIndex < high) { Comparable compElem = (Comparable) list[largeIndex]; if (compElem.compareTo(list[largeIndex + 1]) < 0) largeIndex = largeIndex + 1; } if (temp.compareTo(list[largeIndex]) > 0) break; else { list[low] = list[largeIndex]; low = largeIndex; largeIndex = 2 * low + 1; } } list[low] = (T) temp; } privatevoidbuildHeap(T[] list, intlength) { for (intindex = length / 2 - 1; index >= 0; index--) heapify(list, index, length - 1); } }

The chapter is nested lists  Create code in python using for loops  Thanks!

Select problem below. Your post must include: The problem statement. A description of your solution highlighting the use of the split(), join(), lists and the different list operations involved in solving the problems. Include line numbers from your program dont use JAVA   Make Username. Create a program that reads a full name as a single string, and and uses the split creates a username with the following rules: The first character of the username is the first character of the first name. The second character of the username is the first letter of the middle name, if one was provided. The rest of the characters will be a prefix of the last name, long enough to meet the length requirement. The username can have up to 8 characters only, and in lowercase. Here is a sample execution:

Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

Java/Data Structures: The Java Class Library implementation of the interface list return null when an index is out of range.  True or False

6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?

#Steps: Create a Main class. Declare an ArrayList in the main() method and store the given values in it. Create an array called output of the size of the ArrayList. Iterate through for-loop to get each element from the array List and load it into the array using the get() method of the list. Print the array to see the loaded elements.     import java.util.ArrayList; import java.util.List; public class Main {     public static void main(String[] args) {                 List<String> nameList = new ArrayList<String>();        nameList.add("Robert");        nameList.add("Samson");        nameList.add("Alex");        nameList.add("William");                    System.out.println("Elements of List: " + nameList);                 // Create an array of the same size as nameList Hint: use size() method                   // Fetch the elements from the nameList and insert into newly created array                  // Hint: Use get() method to fetch the elements from…