Hailstone Editor 1 #include Problem Statement Take a number, n. If n is even, divide it by 2. If odd, multiply by 3 and add 1. Repeat with the new number, forever or until you get the number 1. For instance, suppose you start with the number 3: 3 string sequence(int n) f 4 cout <

I need help with using the Stringtokenizer. I'm not sure if it should be in a class, and called in the main. Or should be in my main program.  this is the description : Using StringTokenizer, the program will parse the input file and identify words and integers. Words are notcase sensitive and can only contain letters, apostrophes, hyphens, and digits but must start with a letter. The numbers are a sequence of digits. They can be positive or negative integers. If the number is negative, there is no space between the negative sign, -, and the first digit. A sum will be made form the integers contained in the input file. StringTokenizer  methods  inline now contains the tokens. A few useful method of the StringTokenizer  are: Boolean hasMoreTokens()  // test if there are more tokens available from this tokenizer's string. String nextToken() // returns the next token from this string tokenizer. Int countTokens() //calculates the number of times that this tokenizer's nextToken method can…

Please answer ASAP

My instructor saying my code has wrong indentation on several lines… please let me know which lines. I’ve asked this twice before and I haven’t got it yet

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…