When designing fast convergence on a network using loop-free alternate, on which two basis can the next-hop routes be precomputed? (Choose two)

LFA backup paths are not computed on a per-neighbor basis - the computation is topologically driven using SPF calculations relative to adjacent nodes as defined in RFC 5286, not per individual neighbor adjacency.

Network type (broadcast, point-to-point, NBMA) is not a basis for LFA precomputation; the algorithm derives alternate paths using shortest-path tree calculations independent of interface network type.

Per-link LFA precomputation calculates a backup next-hop that protects against a specific link failure, allowing the router to immediately reroute traffic to the alternate path if that link goes down without triggering SPF convergence delay.

Per-prefix LFA precomputation calculates an individual backup next-hop for each specific destination prefix, providing granular protection and allowing different prefixes to use different repair paths based on their individual SPF topology.

LFA precomputation is based on topology distance inequalities, not failure type - the same precomputed alternate is applied regardless of whether a link or node fails, though node protection requires additional loop-free inequality checks.