Generally speaking, all roads and intersections in Taiwan can be represented by graph theory $($as shown in the figure below$),$ where nodes $($circles$)$ represent intersections, and straight lines between two nodes represent roads. Assuming that there are $n$ roads in Taiwan, please answer $($a$)$ if the value on each line in

the figure below represents the fuel consumption ratio $(k\frac{m}{L})$ of passing through this road section, please use the greedy algorithm to find the path from $v_0$ to $v_8$ with highest fuel consumption ratio $($b$)$ If you want to use the greedy algorithm to find the path with highest fuel consumption ratio between any two points in Taiwan, what is the time complexity in the worst case? $($c$)$ Please explain how to use the concept of divide and conquer in this topic to speed up the operation speed of the above greedy algorithm. $($d$)$ Please use the concept of time complexity to explain why the operation speed of $($c$)$ is faster than $($b$).(8$ points, $2$ points for each mestion$)$