The depth first traversal starting from a for the given graphs A) 4525,6,1 B 4,1253,6 4321.56 D 4.1.235,6 The breadth first traversalstarting from 1 for the given graph is 2 5 A 154236 B 12.453,6 124563 D 1.2.4356 Question 3 Given the following Binary Search Tree, fill in blank write in digit form, for example, 6) The height of the tree isBlank 1 and number of leaves is Blank 2 Blank 1 Add youranswer Blank 2 Add your answer Question 4 Given the following Binary Search Tree if 11 and 19 are removed the preorder of the resultant tree will be: A 10,645.8.4331.49,17 B 106.4,5,8,17.4331,49 456,8,10,173143,49 6,459.10.17 43,31 49 Question 6 The following is a graph(a)and its corresponding adjacency list is TUTININ (b) A True B False uTube Maps M Gmail Study the following method carefully which can be related to a certain class, decide what does it do? public void UnknownEtern) [ Node node = new Node(item Node parent null current chard root nulo root node ebe I current root while current ! nulo 1 parent current it(current data ) Vile the entorno format your one 7 Points Question 11 Write a method called changeQueue to be considered inside the ArrayQurur class and has one parameter ite of type Your method will change the queue in such a way that if the the best element of the queue and the last element of the Queupart equal the best and bast olement in the queue will be replaced with item, otherwise do not do any change. Simibrly the process is done for the second pleraent in the upup and the element before the last in the Queue and so on. Assume you have a non-propty Queue with even number of elements. You are not allowed to callany method from the the ArrayOuruecos Do not use iterators Method head public void changeuruko Exampleli Before run front rear the queue:10 29 2 2510 1.100 After run front rear the queue 100 29 100 100 5 100 Use the form or your answer Orso format you 7 Points Question 12 Wake method caled CompareAndChangelist to be included in an application class called ListApplication that accepts two parameters Intind let2 of type Singlelinked List of integer value and a third parameter Iter of type Int. If list and store of diferent sizes the method turns tabe otherwise the method replaces any elentent in 16t2 with a value equal to the last element in the sumption of the element in last and the corresponding element in list2 is equal to iter. Assume let and list2 are not empty If at least one replacerepot happened the method returns trup, otherwise it returns take Note Write the mothed by calling methods of the class Singlelinked List Method hed: wak bal Cacinglelinte bring it. Single Lindb 12. in vel Example Before Method all item 35 Ist1:23 30 2017 12:10 9 25 15 4 After Method calle st:23 26 10 20 17 Ist2:10 17 15 17 4 In this case the had will return true Note as you can see the Sution of 26 (in list and its corresponding electent in t29 635 which is equal tot, so we replace the erant in fat29 by the value of the last nede in listi which is 17. The same things between the elements 20 (in list) and 15(in lot 2.15 spong to the replaced by 17 The twil nor chart Werforms your one Question 13 5 Points Hement in list 2(9) by the value of the best node going to be replaced by 17 The rest will not change Use the car 10 for your answer S Points Question 13 Write a recursie prate method called countTwoEven Childs to be included in class Binary Tree as discussed in the lectures. The method counts and returns the number of nodes having two children with even data values in the binary tree This method is called from a pubic method CountTweEwen Childset gwen as follows: ! public int countTwoven ChildsBTCX Thurn.countTwo EvenChilds root 1 Method heading private int countTwoEven ChildNodec> node) Useseor to formos your ans Additional content You condeondere to search n