Write an algorithm to solve the shortest path problem following the idea discussed in Section 1 of L5. Please follow the algorithm format used in class discussions. Note that input, output, side effect have to be precise and clear. There should be an explicit connection between output/side effect and input. Important variables/names used should be explained clearly.

What a backup plan that you have created in a event you encounter a situation

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;

Complete the sentence about a presentation delivery method