public class MyString {
	
	//This method will simply reverse the received String and send it back.  Don't worry about case, punctuation or spacing, just reverse it.
	//Examples:  dog--> god,  butter--> rettub,  try harder!-->  !redrah yrt
	public String reverseString(String st)
	{
		
		
		return st;
	}
	
	//This method will return true if the received String is a palindrome. (same forward as backwards)
	//Case and punctuation should not affect the determination of it being a palindrome
	//Examples  radar--> true,  Radar--> true,   Madam, I'm Adam--> true,  food-->  false
	public boolean isPalindrome(String st)
	{
		return true;
	}
	
	//This method will remove any As (capital or lower case that appear in the first two characters of the String. 
	//Any As after the first two characters are left alone.  
	//Examples:   table--> tble, father--> fther, apple--> pple, baseball-->bseball, grand-->grand
	public String removeBeginningAs(String st)
	{
		return st;
	}
	
	//This method will translate a word to Pig Latin.  Here are the rules:
	//1.  If the word starts with a vowel (AEIOU, not Y), simply add "way" to the end of the word.
	//2.  If the word starts with a consonant or consonant blend, move the consonant blend at the beginning of the word to the end of the word and add "ay".
	//3.  The String returned should start with a capital letter and the rest will be lowercase.
	//4.  You can assume it will be a single word.
	//    Examples:  apple--> Appleway,   hammer--> Ammerhay,  TREE-->  Eetray
	public String makePigLatin(String st)
	{
		
		return st;
	}
	
	//This method will return true if the two Strings received are anagrams, meaning they possess the same letters, but may be in different order.  
	//You will be tested with just single, lower case words.
	//Examples:  areAnagrams("snap", "pans")--> true, areAnagrams("inch", "chin")-->true, areAnagrams("ball", "labs")--> false
	public boolean areAnagrams(String st1, String st2)
	{
		
		return false;
	}
	
	//This method will return true if the String received is a $100 word.  The value of a word is found by adding 
	//the value of its letters.  A =$1, B=$2, C=$3, ...Z=$26.  If the sum of the words letter values is $100, return true
	//You can again assume a single word will be provided
	//Examples:  pumpkin--> true, accumulate--> true, computer--> false
	public boolean isHundredDollarWord(String st)
	{
	
		return true;
	}
	
	
}