Here's two C Programming (not c++) questions involving a directed graph (PART A) and a stack (PART B). Can you please help me with these?

Finally if you can't answer the stack question for any reason, it is greatly appreciated if you still can at least help me address the directed graph question.

PART A:GRAPHS The graph below shows the directed cost of travel between several connected cities A-H Students are required to illustrate the following criteria with suitable explanations. Apply Dijkshtra's Algorithm to determine the minimum cost of travel from E to every other city in the graph. Draft the shortest path tree from the results of the algorithm. Demonstrate Depth First Traversal and Breadth First Traversal over the graph from the starting vertex B 10 20 20 10 50 40 10 30 20 PART B: STACKS Write a program for an automated warehouse. The merchandise is stored and retrieved from the warehouse using a computerized robotics system. The procedure for storing and retrieving from the warehouse is as follows A truck with merchandise pulls up to the loading dock. A robot called a Stacker, retrieves the merchandise from the truck and stacks the boxed merchandise onto itself. 3.Once the Stacker has reached its capacity or it empties the truck, the Stacker moves into the warehouse with the merchandise In the warehouse, Stacker unload items starting with the box on top, and loads it into the appropriate storage bin based on the bin id on each box which identifies the type of merchandise in the box. Once the Stacker is empty and if the truck is not empty, the Stacker returns to the truck to get another load. If the truck is empty the Stacker's job is done As merchandise is needed from the warehouse, merchandise removed from the top of the appropriate bin. 4 5. is Write your program to simulate this procedure above, using the following guidelines The size of the truck is allocated dynamically according to user input. The number of boxes hold by the truck is based on user input The Stacker can hold up to 5 boxes There are 5 different types of merchandise, thus 5 different storage bins Each bin can hold up to 5 items. If a new item needs to go into a bin that is full, the item that is at the top of the bin is removed and thrown away using the stack concept. Each box has a bin id number and an item id number. Bin id numbers are 0 to 4 Input: item id and bin id for each box on truck (The input order is the order in which boxes are taken off the truck.) Output: item id and bin id (The output shows the order the warehouse would be emptied if we start at bin 0, then bin 1, then bin 2, etc....) The object stacker and storage bins are stack:s Sample: Input item id 234 345 123 456 890 bin id 4 322 112 Asia Pacific Institute of Information Technology 2018 Algorithms and Data Structures In C Assignment Page 3 of5 113 114 Output:234 123 345 114 113 112 456 322 PART A:GRAPHS The graph below shows the directed cost of travel between several connected cities A-H Students are required to illustrate the following criteria with suitable explanations. Apply Dijkshtra's Algorithm to determine the minimum cost of travel from E to every other city in the graph. Draft the shortest path tree from the results of the algorithm. Demonstrate Depth First Traversal and Breadth First Traversal over the graph from the starting vertex B 10 20 20 10 50 40 10 30 20 PART B: STACKS Write a program for an automated warehouse. The merchandise is stored and retrieved from the warehouse using a computerized robotics system. The procedure for storing and retrieving from the warehouse is as follows A truck with merchandise pulls up to the loading dock. A robot called a Stacker, retrieves the merchandise from the truck and stacks the boxed merchandise onto itself. 3.Once the Stacker has reached its capacity or it empties the truck, the Stacker moves into the warehouse with the merchandise In the warehouse, Stacker unload items starting with the box on top, and loads it into the appropriate storage bin based on the bin id on each box which identifies the type of merchandise in the box. Once the Stacker is empty and if the truck is not empty, the Stacker returns to the truck to get another load. If the truck is empty the Stacker's job is done As merchandise is needed from the warehouse, merchandise removed from the top of the appropriate bin. 4 5. is Write your program to simulate this procedure above, using the following guidelines The size of the truck is allocated dynamically according to user input. The number of boxes hold by the truck is based on user input The Stacker can hold up to 5 boxes There are 5 different types of merchandise, thus 5 different storage bins Each bin can hold up to 5 items. If a new item needs to go into a bin that is full, the item that is at the top of the bin is removed and thrown away using the stack concept. Each box has a bin id number and an item id number. Bin id numbers are 0 to 4 Input: item id and bin id for each box on truck (The input order is the order in which boxes are taken off the truck.) Output: item id and bin id (The output shows the order the warehouse would be emptied if we start at bin 0, then bin 1, then bin 2, etc....) The object stacker and storage bins are stack:s Sample: Input item id 234 345 123 456 890 bin id 4 322 112 Asia Pacific Institute of Information Technology 2018 Algorithms and Data Structures In C Assignment Page 3 of5 113 114 Output:234 123 345 114 113 112 456 322