hi! can anyone solve this string-array problem or give me just an example about it
- Write a program that converts a sentence input by the user into pig latin. You can assume
that the sentence contains no punctuation. The rules for pig latin are as follows:
a) For words that begin with consonants, move the leading consonant to the end of the word
and add “ay”. Thus, “ball” becomes “allbay”; “button” becomes “uttonbay”; and so
forth.
b) For words that begin with vowels, add “way” to the end. Thus “all” becomes “allway”,
“one” becomes “oneway”; and so forth