What of the following statements are true according to the Chord paper by Ian Stoica, Robert Morris, and other co$-$authors?

Group of answer choices

$($A$)$ Chord is a uni$-$dimensional DHT based peer to peer search protocol for fast and deterministic search.

$($B$)$ Chord is vulnerable for node failure.

$($C$)$ Chord improves the search performance by creating and maintaining a finger table for each node.

$($D$)$ Chord is resilient against network partitions and adversarial nodes.

$($E$)$ Chord does not provide any load balancing strategy in the presence of heterogeneous nodes.