A network engineer must optimize a campus OSPF deployment. Currently, each time a type 1 or type 2 LSA is generated within an area, the OSPF process must recompute the entire SPT. Which solution…

SPF is the standard full Dijkstra shortest-path computation that recalculates the entire SPT from the root - this is precisely the inefficient behavior the question is asking how to improve.

PRC (Partial Route Calculation) is an optimization for Type 3, 4, 5, and 7 LSA changes (inter-area and external routes), not for Type 1 or Type 2 intra-area LSAs.

BFD (Bidirectional Forwarding Detection) accelerates failure detection by sending sub-second hello packets, but it plays no role in optimizing the SPT recomputation algorithm itself.

iSPF (Incremental Shortest Path First) tracks which nodes in the SPT are impacted by a received Type 1 or Type 2 LSA change and recomputes only those affected subtrees. This dramatically reduces CPU overhead in large areas because the router avoids processing the entire topology graph each time a single link-state change occurs.