JAVA Question 16 (6 points) Given an empty Queue q and empty Stacks. Show what Q...

Q16. Since Queue maintains FIFO order i.e., elements which entered first will be removed first. While Stack follows LIFO order i.e., elements which enter last will come out first .

So the elements present in q: 7

Elements present in s: (Top ---- > Bottom) 7,5,4

Q.17 NOTE: Error are marked in Bold.

Error 1 : public void test1(String str) throws myException{

Error 2:  if(str.compareTo("nervous")==0)
throw new myException();

Error 3:  public void test2(){

try{

test1("hello");

}

catch (myException e){

  System.out.println("This is the end");

}

}