1 (page 4 of 14) - Google Chrome biz/attempt.php?attempt=80023&cmid=80120&page=3 suppose you have ql as integer queue with the following data [1,2,3,4,5,6), where I is at the front of the queue and ql is passed to a recursive method fl(), what the output of executing f1(2 void fl( Lqueue el ) { System.out.print (q1.dequeue()); if (!ql.isEmpty) fi( q1) Select one: a 1,2,3,4,5,6 b. 6,5,4,3,2,1 c method fi is not executable d. 1.6.2.5,3,4 The Postorder Traversal of the following tree is: ED hop OV