i attached the assignment document only i need your help with following three parts:
accessible areas, accessible cul-de-sacs that are all connected, entry-exit path with no intersection not to cul-de-sacs
SO THE OUT WILL LIKE THIS EXAMPLE PRESENTED HERE DOWN:
1-The maze has 4 accessible areas.
2-The maze has 3 sets of accessible cul-de-sacs that are all connected.
3-The maze has a unique entry-exit path with no intersection not to cul-de-sacs.
some sample test file attached to make sure that the answer correct also the maze.c is the templet for your code is in attachment .