vew Help Grammary P Tel me what you want to do the Internet can contain viruses. Unless you need to edit, it's safer to stay in Protected View Enable Editing The problem: The squares puzzle: "How many one-by -one squares will be generated by an algorithm that starts with a single square and, on each iteration, adds squares all around the outside." n 1 n-2 etc. The answer to this puzzle can be described three different ways. implement the following public methods: You are to write three static methods that 1) A static method called puzzleformula(int n), which returns an integer that is the number of squares You should use the following formula to calculate it 2n+ 2n +1 A static method called puzzleLoopint You should use a loop to implement the following formula (2n+ 2) n) , which returns an integer that is the number of squares 2-1 3) A static method called puzzleRecurselint n), which returns an integer that is the mumber of squares You should implement it recursively using the following formula S0) 1 $(n)" S(n-1)+"In for n>=1 Testing your program: you can use either the "console" deiv er program for testing. Obriously, you sbould come out with the same answers on every method Please submit: your zipped malRecursionEC Project in Canvas