Data Structure and Algorithm in Java

Please answer it with editable source codes that can be run in NetsBean based on Java. I don't need comments or information I need the entire source code that can run.

3. Union-Find Maze write a program that generates mazes of arbitrary size using the union-find algorithm. A simple algorithm to generate the maze is to start by creating an N x M grid of cells separated by walls on all sides, except for entrance and exit. Then continually choose a wall randomly, and knock it down if the cells are not already connected to each other. If we repeat the process until the starting an ending cells are connected, we have a maze. It is better to continue knocking down the walls until eve cell is reachable from every cell as this would generate more false leads Test you algorithm by creating a 10 x 10 grid, and print all the walls that have been knocked down. Draw the resulting maze (hand-drawing is acceptable)