For this Question: Given a String of length S, reverse the whole string without reversing the individual words in it. Words are separated by dots.First line of input contains T, number of testcases. Each testcase contains a string S containing characters.

Constraints:
1 <= T <= 100
1 <= |S| <= 10000For each test case, in a new line, output a single line containing the reversed String.Example:
Input:
2
i.like.this.program.very.much
pqr.mno

Output:
much.very.program.this.like.i
mno.pqr, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException
	{
		InputStreamReader ip=new InputStreamReader(System.in);
		BufferedReader br=new BufferedReader(ip);
		int T=Integer.parseInt(br.readLine());
		while(T-->0)
		{
		String S[]=br.readLine().split("\\.");
		String res[]=new String[S.length];
		int j=0;
		for(int i=S.length-1;i>=0;i--)
		{
			res[j]=S[i];
			j++;

		}
		System.out.print(res[0]);
		for(int i=1;i<res.length;i++)
		{
			System.out.print("."+res[i]);
		}
		System.out.println();
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?