c) Find the shortest path and its length from 0 to 4 using the Dijkstra Algorithm for the following graph in Figure 4 0 4 8 1 7 11 8 7 1 2 2 8 6 6 7 2 Figure 4 4 3 5 14 9 4 10

Write a dynamic programming solution to find the nth Fibonacci number.

Add a main function to the following python code and organize the program using mainline logic.  def resistance(i,e):    return e/i #Compute the total resistance as per the given formula    def parallel_resistance(r1,r2,r3):    return 1.0/((1.0/r1)+(1.0/r2)+(1.0/r3)) #Compute the series resistance def series_resistance(r1,r2,r3):    return r1+r2+r3 #Read the voltage e1=float(input('Voltage 1 : '))e2=float(input('Voltage 2 : '))e3=float(input('Voltage 3 : ')) #Read the currenti1=float(input('Current 1 : '))i2=float(input('Current 2 : '))i3=float(input('Current 3 : ')) #Compute the resistance r1=resistance(i1,e1)r2=resistance(i2,e2)r3=resistance(i3,e3)     #Compute the resistance in parallel Circuitrp=parallel_resistance(r1,r2,r3) #Compute the resistance in series Circuitrs=series_resistance(r1,r2,r3) #Display the result  print('Resistance in Parallel Circuit : {0:.2f}'.format(rp))print('Resistance in Series  Circuit : {0:.2f}'.format(rs))

Python