Servers are set up for data partitioning using a ring topology as shown in a) A new server is added (Server 3 ) as shown in b). Which data will be rehashed to the new server? a) b) Data between position 0.58 and 0.75 will be moved from Server 0 to Server 3. Equal amounts of data from Server 0, 1, and 2 will be rehashed to Server 3 Data between position 0.75 and 0.99 All the data from positions 0.00 to 0.75 Key value stores like Redis and Memcached are "in memory" data stores. This means that: data stored is not persistent data is written to a hard disk or solid state drive these data systems are slower than relational databases they store data in JSON files Which of the following is true about querying constraints on a Key value store? The database does not consider the internal structure of any of the "values". Key value stores maintain referential integrity between objects The database schema allows a key to be added only once Mathematical operations can be performed on values