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

Per-neighbor is not a defined basis for LFA precomputation in RFC 5286 - LFA calculates alternate paths based on topological distances to prefixes and links, not on a per-neighbor granularity.

Per failure type is not a standard LFA computation basis - LFA addresses link and node failure scenarios through per-prefix and per-link calculations rather than categorizing by failure type.

Per-prefix LFA computation evaluates each individual destination prefix independently and assigns it the most optimal loop-free alternate next-hop, allowing granular backup path selection tailored to each route's topology.

Per-link LFA computation pre-calculates alternate paths for each specific link failure scenario in advance, so when a link goes down the router can instantly install the precomputed backup without waiting for SPF to converge.

Per network type is not a basis for LFA precomputation - the LFA algorithm operates on SPF-derived cost metrics and topology, not on OSPF network type classifications.