Please Solve the Answer Accordingly and do not copy from others make sure you provide reasoning with your answer. I will dislike if the answer is poor

Given the following program, which of the following lines of the main method will run NITHOUT ERROR? Select all which apply. public interface Eraseable \{ public void e(); \} public class Writer \{ public String w() \{\} public void x(){} public class Pencil extends Writer implements Eraseable \{ public void e() \{\} public vaid f(){} wrlter W1= new Pencl 1(J;/1 LINE Eraseable e1 = (Eraseable) w1; // LINE 2 w1.x(); // LINE 3 w1.e(); // LINE 4 \} \} LINE 1 LINE 2 LINE 3 LINE 4 Given this bounded generic class definition: which of the following standard Java types CANNOT be stored in an instance of this binary search tree? java.lang.Object java.lang.String At which node does the operation begin? the last internal node of the heap the last leaf node of the heap Consider a BST that is created by inserting the nodes: 8,12,10,14,11 (in that order). What value is in the node representing the parent of the 11 ? 8101214 None. 11 will be at the root. In a binary search tree, the value in the rightmost node of the root's left subtree is its predecessor successor In which traversal algorithm is the root of a binary tree visited LAST? in-order traversal post-order traversal