Write a Scheme program to implement QuickSort and then return the final element of the sorted list. Use the following list for your input: A = {21, 43, 45, 74, 30, 79, 14, 78, 26, 61, 89, 57, 1, 96, 46, 2, 37, 84, 23, 39}

Add 2 lists to this BMI Program and then add a function where it is used. Identify them. How does this new list manage complexity in your program? #BMI Program def printBMI(weight,height): bmi = weight/(height*height) print("BMI is: ",bmi,"and you are ",end="") if bmi <= 18.5: print("underweight") elif 18.5 < bmi < 25: print("normal") elif 25 < bmi < 30: print("overweight") elif bmi > 30: print("obese") #MAIN PROGRAM choice = input("Press I for imperial or M for metric: ") if choice == 'I': Imperialweight = float(input("Enter weight in pounds: ")) Imperialheight = float(input("Enter height in feet (decimals): ")) Imperialweight = Imperialweight * 703 Imperialheight = Imperialheight * 12 printBMI(Imperialweight ,Imperialheight) elif choice == 'M': Metricweight = float(input("Enter weight in kilograms: ")) Metricheight = float(input("Enter height in meters: ")) printBMI(Metricweight,Metricheight)

Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

Write a function cmid to count elements of an integer list between 5 and 10. One function only.cmid [12,3,6,4,5,1] → 2