PLEASE SOLVE IN JAVA AND PROVIDE COMMENTS.

Camel Case Machine ** Programming challenge description: Reformat a series of strings into Camel Case by returning the fragments from input as a single "sentence". For example, consider the following input: * 1 import java.io.BufferedReader; 2 import java.io.IOException; 3 import java.io.InputStreamReader; 4 import java.lang. *; 5 import java.nio.charset StandardCharsets; 6 7 8 * The Main class implements an application that reads lines from the standard input 9 * and prints them to the standard output. 10 11 public class Main 12 { 13 public static void main(String[] args) { 14 try{ 15 InputStreamReader reader=new InputStreamReader(System.in,Standardcharsets.UTF_8); 16 BufferedReader in=new BufferedReader(reader) 17 } 18 19 } 20 Camel Case LOOKS like This } Would result in: camelCase looks Like This Input: A series of strings with one fragment on each line of input. All characters will be from the ASCII character set. Output: A single line with the inputs assembled in Camel Case Test 1 Test Input Apple One >_ Test Case Output Apple Test 1 Test Input Apple One Apple TWO APPLE three Expected Output appleOne appleTwo appleThree Test 2 Test Input MERCURY VENUS EARTH MARS GIANTS JUPITER SATURN URANUS NEPTUNE PLUTO VENUS EARTH MARS GIANTS JUPITER SATURN URANUS NEPTUNE PLUTO Expected Output mercury venus earth mars giantsJupiterSaturnUranusNeptune pluto Test 3 Test Input @ the dog jumped over the lazy moon Expected Output theDogJumpedoverTheLazyMoon