Q5

Study the scenario and complete the questions that follow: You are heading a team of software developers who have been given a task to design an application that will search a name in the list of students enrolled for ITDPA2. Based on your data structure and algorithm knowledge, you have suggested to your team members that the easiest way to find a name in a stored array is by the implementation of the binary search tree. A sample of students with their respective marks is given on the table Keep in mind that students are arranged in list format and the list only stores the marks of the student. The marks of the first student1 occupies the first index, and so on. Question 5 5.1 Write the array (list) for the marks, then draw a binary search tree BST to store the marks of the array. (10 Marks) 5.2 Provide a python implementation of the search tree structure provide in the previous question (5 Marks) 5.3 Write a python implementation of depth first search traversal on your BST ensuring that the output is a sorted list from the minimum to the maximum. then calculate the value of the division of the maximin and minimum values in the BST and print it out. A sample output (10 Marks)