Please explain in details the checked answer . Show how it is the answer.

. The running time of the methods get (i) and remove(i) for an ArrayList are (a) O(1) and O(1), respectively (b) (1 +i) and O(1 +), respectively (e) O(1) and ), respectively (d) o(1+i and O(1+size -), respectively 01) and 0(1 + size()-1), respectively 6. The running time of the methods get (i) and reove(i) for a LinkedList are (a) O(1 +) and (1 +), respectively (b) (1) and O(1 +size)-i), respectively (c) (1 +size)-i and O(1), respectively (1 + min{i, size()-iJ) and 0(1 + min{i. size()-1)), respectively. (e) O(1) and O(1 size) ), respectively 7. public static void frontGets (Liat 1 int for (inti-0; i 1, int n) Randon gen neu Randon for (int i 0 1