An HP switch has an LACP link aggregation with two links. How does the switch balance traffic over the links?

A.
It assigns the first conversation (as defined by the load-balancing algorithm) to the first link, the second
conversation to the second link, and so on in a round-robin fashion.

B.
It assigns each conversation (as defined by the load-balancing algorithm) to a consistent link based on a
hash.

C.
It assigns all traffic to the first link until the link reaches a bandwidth threshold; it then assigns traffic to the
second link.

D.
It assigns the first packet to the first link, the second packet to the second link, and so on in a round-robin
fashion.