These questions are from Data Structures. Please answer each part of the question in details as to why each of the answer correct and why the other options are wrong. Please provide details. For sufficient answer quality, I'd give a thumbs up and otherwise if the answer is short and not understood. Please explain as if you are explain the concept to a kid. Please answer all parts of the questions shown

Question 8 5/5 pts Given the following binary search tree stored in an array using the labelling scheme: 7,3,9, (meaning 7 is stored at index 0,3 is stored at index 1 and 9 is stored at index 2). If we further insert 1,4,5,12,10, which indices will they go to in the array? 1 will go to , 4 will go to , 5 will go to 12 will go to and 10 will go to