Please solve these problems ASAP. Its due date is tomorrow. It is about the computer science. Thank you very much.

University of Massachusetts Boston, Department of Computer Science CS105: An Introduction to Computer Concepts Homework Assignment 4 Due Tue. Wednesday March. 29 2017 before the class through blackboard Every question worth 20 points Use the following list values for all the questions [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 1- Show the state of the list when firstU is equal to 4th element in the selection nsorted sort. 2- Show the state of the list when firstUh is equal to 5th element in the bubble nsorted sort. 3- Show the state of the list when the first recursive call is made in QuickSort using list[0] as split value. 4- Draw a binary search tree for the list with list[0] as root. 5- Write the output of DFs and BFs algorithms for the tree that you draw for the previous