Implement A* search algorithm in a maze in Java. Make it a text-based console program.

Problem: in a grid world, find a path from the upper left corner to the bottom right, avoiding obstacles.

The grid is represented as a 2-dimentional array. Implement a routine to read it from a text file. You can assume fixed dimensions, eg. 40x25.

An obstacle is represented by symbol x. A free cell is represented by a space ( ).

Pick an appropriate heuristic.

Output path in a text file.

Test on at least 3 mazes. Include input files and copies of output.

Submit a zip file with source and data files. Follow coding style conventions; add appropriate comments.