Java only

Write a program that reads a sentence and then prints a diamond shaped tree for every word in the sentence. As an example, if the string has the value "sample text", then the program should print the pattern (as shown, in capitals for each word) Save As Assign21 Enter a Sentence: sample text \begin{tabular}{l|l} \multicolumn{1}{c}{ S } & Note: The split function can be used \\ SAS & to separate the words in the \\ SAMAS & sentence. \\ SAMPMAS & String words[]; \\ SAMPLPMAS & \\ SAMPLELPMAS & words=sentence.split(" "); \\ SAMPLPMAS & This will place each word into an array \\ SAMPMAS & based on a space. \\ SAMAS & \\ SAS & \\ S & \\ A & \\ P & \\ L & \\ E & \\ T & \end{tabular} The program should work for any string of any size