import java.io.*;
import java.util.*;

/*
* This class models a tunnel map
*/
public class TunnelMap {
public int rows; // number of map rows
public int cols; // number of map columns
public char[][] mapData; // raw map data, i.e., mapData[i][j] is the char at row i and column j of the map file. Here i goes from 0 to rows-1, and j from 0 to columns-1.
public Position[] ghosts; // an array of the ghost positions. The size should be equal to the number of ghosts.
public Position[] zombies; // an array of the zombie positions. The size should be equal to the number of zombies.

   private final char WALL = '#';
   private final char GHOST = 'G';
   private final char ZOOMBIE = 'Z';

public TunnelMap() {
// the following code initializes the object with a simple test map
this.rows = 4;
this.cols = 4;
this.mapData = new char[][] {
{'#',' ','#','#'},
{' ',' ',' ','Z'},
{'#','G',' ','#'},
{'#','#',' ','#'},
};
this.ghosts = new Position[] {new Position(2,1)};
this.zombies = new Position[] {new Position(1,3)};
}

/*
* Exercise 2.1
*/
public void loadMap(String fileName) {
         try {
            Scanner scanner = new Scanner(new File(fileName) );
            rows = Integer.parseInt(scanner.nextLine());
            cols = Integer.parseInt(scanner.nextLine());
            int ghost = Integer.parseInt(scanner.nextLine());
            int zombie = Integer.parseInt(scanner.nextLine());
            ghosts = new Position[ghost];
            zombies = new Position[zombie];
            mapData = new char[rows][cols];

            ghost = 0;
            zombie = 0;

            String line;
            char c;
            for (int i = 0; i < mapData.length; i++) {
               line = scanner.nextLine();
               for (int j = 0; j < mapData[0].length; j++) {

Tries and Stacks Using C, C++, or Java implement the following dat...