$3)$ Vehicle Routing An intercampus shutule can take one of several routes. For each run, a dispatcher checks what the current traffic conditioss are to find out the average speed on each route and determine wit route the shuttle driver should take. a$)$ Write a program that, in a while loop: prompts for two inputs: distance in miles and speed in miles per hour $-$ calculates the time the route should take $($in minutes$)$ and displays this result $-$ keeps track of which alternative route is the fastest and displays this after all routes are entered Here is an example session: Enter route $1$ distance $($miles$)$: $30$ Enter route $1$ speed $($miles$/$hour$)$ : $60$ More routes $($ y$/$n$)7$:y Enter route $2$ distance $($eiles$)$: $25$ Enter route $2$ speed $($mileshour$)$ : $55$ More routes$($y$/$n$)?$ Route $2$ is fastest; $27$ minutes b$)$ Asume current traffic conditions are as follows. Run your program uxing the data below to determise the fautect rouk. $\backslash$begin$\{$tabular$\}\{|$l$|$c$|$c$|\}\backslash$hline Route Type & $\backslash$begin$\{$tabular$\}\{$c$\}$ Distance $\backslash ($miles$)\backslash$end$\{$tabular$\}$ & $\backslash$begin$\{$tabular$\}\{$c$\}$ Current sped $\backslash ($mileshour$)\backslash$end$\{$tabular$\}\backslash \backslash$hline local & $30$ & $30\backslash \backslash$hline parkway & $35$ & $40\backslash \backslash$hline highway & $48$ & $55\backslash \backslash$hline $\backslash$end$\{$tabular$\}$ c$)$ Enhance your program to detect invalid inputs of $0$ or negative values for distance or speed$\mathrm{.}1-$ creates a Python code $\mathrm{.}2-$ Create a flowchart the visually depicts how the program will work$\mathrm{.}3-$ write program Pseudocode $($ detail algorithm$)$ and add it as a comment block to the submitted program.