Fix the Java code. Is the grid walker program but one T should always be generated, the program geneartes none some times. Also the programs finishes in the first step, and only one condition seems to work but not. Debug it please.

import java.util.Random; import java.util.Scanner;

public class GridWalker { public static void main(String[] args) { Scanner input = new Scanner(System.in); Random random = new Random();

// Ask the user for the number of rows and columns System.out.print("Enter the number of rows: "); int numRows = input.nextInt(); System.out.print("Enter the number of columns: "); int numCols = input.nextInt();

// Create the grid of the specified size char[][] grid = new char[numRows][numCols];

// Fill the grid with U, D, L, or R at random for (int i = 0; i < numRows; i++) { for (int j = 0; j < numCols; j++) { boolean foundT = false; if (!foundT && random.nextInt(numRows * numCols) == 0) { grid[i][j] = 'T'; foundT = true; } else { int direction = random.nextInt(4); switch (direction) { case 0: grid[i][j] = 'U'; break; case 1: grid[i][j] = 'D'; break; case 2: grid[i][j] = 'L'; break; case 3: grid[i][j] = 'R'; break; } } } }

// Print the initial grid System.out.println("Initial grid:"); printGrid(grid);

// Ask the user for a starting row and column System.out.print("Enter the starting row: "); int startRow = input.nextInt(); System.out.print("Enter the starting column: "); int startCol = input.nextInt();

// Follow the path indicated by the letters until one of the conditions occurs boolean offGrid = false; boolean intersect = false; boolean foundT = false; int steps = 0; int currentRow = startRow; int currentCol = startCol; while (!offGrid && !intersect && !foundT) { // Mark the current position with a * grid[currentRow][currentCol] = '*';

// Move in the direction indicated by the letter switch (grid[currentRow][currentCol]) { case 'U': currentRow--; break; case 'D': currentRow++; break; case 'L': currentCol--; break; case 'R': currentCol++; break; case 'T': foundT = true; break; }

// Check if the current position is off the grid or has already been visited if (currentRow < 0 || currentRow >= numRows || currentCol < 0 || currentCol >= numCols) { offGrid = true; } else if (grid[currentRow][currentCol] == '*') { intersect = true; }

steps++; }

// Print the final grid with the path marked in stars if (offGrid) { System.out.println("You left the grid!"); } else if (intersect) { System.out.println("Your path intersected itself!"); } else { System.out.println("You finished in " + steps + " steps."); } System.out.println("Final grid:"); printGrid(grid); }

// Method to print the grid public static void printGrid(char[][] grid) { for (int i = 0; i < grid.length; i++) { for (int j = 0; j < grid[0].length; j++) { System.out.print(grid[i][j] + " "); } System.out.println(); } } }