java help!

part2: what is the time complexity of what you just wrote?

ts) Write a method called concatenate, which takes two lists, which we'll refer to as A and B and changes A such that it has A's elements first, then B's elements. For example, if A is [1,3,5) and B is 12.4.6), concatenate changes A to 1,3,5, 2,4,6). Make your solution as optimal as possible. // Since this is inside LinkedList // You can use the head and tail of A and B public void concatenate(LinkedList A, LinkedList