Python ADT stack and graphs:

$1,$ Application of the stack $(1)$: Design a function to finish the decimal covert to the hexadecimal using the Python stack.

$2,$ Application of the stack $(2)$: Design a function to check if brackets match including mixed square brackets, curly braces, and parentheses.

$3,$ Create Dijkstra$$s algorithm function and finish a total of $5$ given graphs $($find in the course slide$)$ traverse and find all nodes to other neighbor nodes' shortest path, and plot all graphs $($nodes$,$ edges, weights$)$ in your report.

$4,$ Create prim's algorithm function and finish a total of $5$ given graphs $($find in the course slide$)$ and traverse all nodes minimum weight cost.

Compare Dijkstra$$s algorithm and Prim's algorithm to find path differences when using the same graphs.

$5.$ Check the GitHub Q$-$learning example, and try to use the Reinforcement Learning algorithm to find the shortest path$($each node to other nodes$),$ you can design any kind of graph as you like $($total nodes over $20),$ please explain how the algorithm works.