In a Chord ring with m$=7,$ three successive peers have ids $12,28,60,68,84,100($there are other

peers in the system too, but not in between $12$ and $100).$ If the number of files is large and a uniform hash function

is used, which of the following ARE definitely true? If you find that one or more nodes are true in one statement

write them under the statement else do not write anything for that statement

$1)$ Peer $12$ stores about the same number of files as peer: $28606884100$

$2)$ Peer $60$ stores about the same number of files as peer: $6,84,100$

$3)$ Peer $28$ stores about double the number of files as peer: $12,60,68,84,1005)$ Peer $84$ stores about double the number of files as peer: $12,28,60,68,100$

$6)$ Peer $100$ stores about double the number of files as peer: $12,28,60,68,84$

$7)$ Peer $68$ stores about triple the number of files as peer: $12,28,60,84,100$

$8)$ Peer $84$ stores about triple the number of files as peer: $12,28,60,68,100$

$9)$ Peer $60$ stores about quadruple the number of files as peer: $12,28,68,84,100$

$10)$ Peer $68$ stores about quadruple the number of files as peer: $12,28,60,84,100$

Each id stores the information from the peers from the preceding id to the current id$.$ For example, peer $28$ stores

data from node $13-28.$ If the number of files is large and a uniform hash function is used, then the goal is to have an

equal load on each node.