A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.

Fix the code below so that there is a function that calculate the height of the triangle.   package recursion; import javax.swing.*;import java.awt.*; /** * Draw a Sierpinski Triangle of a given order on a JPanel. *  *  */public class SierpinskiPanel extends JPanel {     private static final int WIDTH = 810;    private static final int HEIGHT = 830;        private int order;     /**     * Construct a new SierpinskiPanel.     */    public SierpinskiPanel(int order) {                this.order = order;                this.setMinimumSize(new Dimension(WIDTH, HEIGHT));        this.setMaximumSize(new Dimension(WIDTH, HEIGHT));        this.setPreferredSize(new Dimension(WIDTH, HEIGHT));    }        public static double height(double size) {        double h = (size * Math.sqrt(3)) / 2.0;        return h;    }    /**     * Draw an inverted triangle at the specified location on this JPanel.     *      * @param x the x coordinate of the upper left corner of the triangle     * @param y the y…

Profile the performance of the memoized version of the Fibonacci function defined in Project 6. The function should count the number of recursive calls. State its computational complexity using big-O notation, and justify your answer. The fib function header has been modified to include the counter as the second parameter. Define the Counter class, it should have three methods: __init__, increment, and __str__. When an instance of the Counter class is passed as a parameter, the count property of that instance should be incremented based on the number of recursive calls. The __str__ method should return the count property's value as a string. -----------------------------------------------------------------------------------   """ File: fib.py Project 11.7 Employs memoization to improve the efficiency of recursive Fibonacci. Counts the calls and displays the results. """ class Counter(object):     """Tracks a count."""     # Define the Counter class here. def fib(n, counter = None):…

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…