B2. Convert the infix expressions expression a - [b+cd)/e into postfix expressions Stack Character/Symbol Postfix expression Section B: Short Answer Questions Answer all the questions (3 x 5 marks = 15 marks) Bl. Given the function T(n) = n3 + 20n +5, show that T(n) is O(n) F B3. Consider an array a[] = { "Abdullah", "Butaina", "George". "Inam", "Jim", "kawther", "kavin", "Raba", "Robin", "Roza"}. The name "George" (target) to be searched using the binary search algorithm given below. Trace the variables low, high, and mid to complete the task. low high mid Public int binarySearch(String a, String target) { low=0; high=a.length-1 While (low = size) { System.out.println("Invalid position"); return; } else { } size: } b) Complete the following fragments of code to insert a node at the beginning of the list. public class insertFront(int data) { } 3030 Page 3 of 8 College of applied Sciences ITDR210 Data Structure