Select all of the statements that are true regarding the structure of a Binary Min Heap.

Its edges each include a weight value.

$$ It supports direct access by index.

$[$ The key of any node has a value $=$ all key values in its sub$-$trees

It uses a hash function to compute an index into an array of buckets or slots, from which the desired value can be found or stored.

$$ There are no cycles $($circular references$)$ in the structure.

Each node has either two children and one data element or three children and two data elements.

C Each node contains a piece of data called a key.

$$ It is a collection of linked data structures called nodes.

$$ The last node in the sequence contains a pointer $($or reference$)$ to the first node in the sequence.