opEn shortEst pAth First(ospF)is A (71) routing Algorithm thAt (72) work DonE on thEosi is-is intrADomAin routing protoCol. this routing, As CompArED to DistAnCE-vECtor routing,rEquirEs (73) proCEssing powEr. thE (74) Algorithm is usED to CAlCulAtE mutEs. ospFrouting tABlE upDAtEs only tAkE plACE whEn nECEssAry, (75) At rEgulAr intErvAls.
A．BEllmAn-ForD
B、ForD-FulkErson
C．DijkstrA
D、rip