I need help with this C$++$ Program. I have most of the code but it's inputting a different number instead of $18$ seconds for the Set $1$ Quickest path.

The definition by APM Body of Knowledge $7$th edition of a Business Case is one that $$provides justification for undertaking a project, programme or portfolio$.$ This is further explained by the article: $$The Right Way to Present Your Business Case$$ by Carolyn O$$Hara on the site, Harvard Business Review. The article goes on to detail how one can properly and more efficiently deliver a business case that$$s persuasive while being straight to the point. If it$$s not communicated in a well manner, then it$$s pointless if the business case is a solid once that$$s very well planned out. Ou basically need to be persuasive and not just use numbers and figures. This can be done through the use of a story. The story can be further broken down into outlining a need, impact and a solution while making it clear what$$s at stake. The more it is story$-$like and uses emotional and human connection, the better your business case will come across.

First, before presenting the business case though, you still need the facts and research such as what are the strengths, the weaknesses, opportunities and threats. The strengths can be about the value of the product while the weaknesses should be researched and stated. The goals need to be realistic and well$-$defined for when the project will be done. The project will need a business case to justify the project. It will need to answer the following during its presentation: Why, when, how much, what are the risks, what are the alternatives and how will the success of the project be measured?

You could also use testimonials in your business case that outline why it$$s a good idea to move forward with the project. The article makes a good point in stating that business cases are usually attempting to make change and people are not so keen on change. Therefore, instead of appealing to the mind with only facts and figures, you should appeal to the heart. You can use an attention grabber by using the need for the technology being presented because a business might not always pursue a project even if there$$s an opportunity for improvement. Addressing the concerns of the audience is another way of gaining supporters for your business case. For example, if the finance personnel s concerned about how much a project or technology will cost, be sure to address that and have a good reason for the expenses while limiting them. Additionally, if there is someone in the audience who is interested in the growth of the company, make sure to point out how the project will expand its reach to other regions of the world. Always have an answer ready for any potential questions.

Finding the right way to present your business case is just as important, states the article. If the presentation has far too many slides that are too busy with overwhelming information and detailed needless graphs, you will lose your audience. Keep it simple and to the point with straightforward visuals that are easy to read and understand. Remember to tell a story with your business case and have a concise and detailed version of it while presenting the need and reason to care about it$.$ Do not forget to address concerns or overwhelm your audience with unnecessary information or visuaSample File: Sample Run:

$2$

$248$

########

#S$.$###$..$

##$.....$#

#TT#####

E$.......$

T######$.$

T#######

TT######

$222$

ST

T$.$

TT

TE

Enter filename: rat.txt

Set $1$:

Shortest Path: $9$ spaces

Quickest Path: $18$ seconds

Set $2$:

Shortest Path: $3$ spaces

Quickest Path: $6$ seconds

Run again $($Y$/$N$)$: n$.$

#include

#include

#include

#include

#include

#include $//$ Include for memset

using namespace std;

struct Cell $\{$

int layer, row, col, dist, time;

Cell$($int l$,$ int r$,$ int c$,$ int d$,$ int t$)$ : layer$($l$),$ row$($r$),$ col$($c$),$ dist$($d$),$ time$($t$)\{\}$

$\}$;

const int MAX$\_$LAYERS $=10$;

const int MAX$\_$ROWS $=10$;

const int MAX$\_$COLS $=10$;

const int INF $=$ INT$\_$MAX;

int layers, rows, cols;

char maze$[$MAX$\_$LAYERS$][$MAX$\_$ROWS$][$MAX$\_$COLS$]$;

bool visited$[$MAX$\_$LAYERS$][$MAX$\_$ROWS$][$MAX$\_$COLS$]$;

$//$ Directions for movement: Up$,$ Down, Right, Left

const int dz$[]=\{-1,1,0,0\}$;

const int dx$[]=\{0,0,1,-1\}$;

const int dy$[]=\{1,-1,0,0\}$;

$//$ Function to check if a cell is valid to move to

bool isValid$($int layer, int row, int col$)\{$

return $($layer $>=0$ && layer $<$ layers && row $>=0$ && row $<$ rows && col $>=0$ && col $<$ cols &&

maze$[$layer$][$row$][$col$]!=\text{'}$#$\text{'}$ && $!$visited$[$layer$][$row$][$col$])$;

$\}$

$//$ Function to find the shortest and quickest paths using BFS

pair shortestQuickestPath$($int startLayer, int startRow, int startCol, int endLayer, int endRow, int endCol$)\{$

queue q;

q$.$push$($Cell$($startLayer$,$ startRow, startCol, $0,0))$;

visited$[$startLayer$][$startRow$][$startCol$]=$ true;

int shortest $=$ INF;

int quickest $=$ INF;

while $(!$q$.$empt