answers only please

no explination

12 points Question 2... Write the method divisiblelyk which receives a list of integers and a number k. The method should retum a new list containing all the integers in that are divisible by k. If there is no integer in I divisible by the value k, then the method should display in appropriate message and returns an empty list. Example 1. If List 1: 12 8 5 6 7 9 10 12 13) and k = 3, then, the method should return the list (36918) public static LinkedList Integer > divisibleByLinkedlist integer > 1. Ist ) Linkedlist Integer n - new LinkedList Integer(); if (...) System.out.println("Listutsenpty"): else { while (...) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 > if(...) if (...) System.out.println(nejvalue inuluisudivisible byk): 16 > 212 Page 2 of 10 Lite 3: 6. Line 10 A 1.haslixto B 1.0 0 1.full) (B) 1.find() non D 1.) E None D 1 lust (E) None 7 Line 12 Line : al.next(): B i indirett: fidext WA D 1.find E) None A irtive B 1 retro C retrieve D 1 ) (E) None 8. Laine 13 Line 7 A retrieve 1. retrieve()* 1. retrieve C) 1.lt B 1.rell c 1.insert): Disert retrieve) (E) None (D) 1. Last (E) None 4. Line 8 9. Lime 14: A 1.mpty) B 1.t C) solo A retrieval) Bretrteve) if (retrieve() (D) 1.retrieve(): E None D slepty E None 10. Line 17 5. Line 9: A1 ni retrieve() (B) : C i et D. B 1 retrievei mull 1.tssert Col.retrieve) D alisert retrieve) None None