Updated readme

Author: malik727

README.md

@@ -41,7 +41,7 @@ Let's consider a scenario where the data is not located on a single machine but
 <br/>
 <h3>Data Collision Concept</h3>
 <p>
-  Above we discussed how the data is stored on the active machines of the identifier space but what if more than one key hashes to a same id(eg. "Awesome Game" & "Good Movie" noth hash to value of 10)? In order solve this problem we use the concept of chaining lists. Every node of the binary search tree of a machine holds a singly linked list instead of just holding a single key/value pair. Whenever more than two keys hash to the same id they are inserted in the relevant linked list of BST(Binary Search Tree) of the machine. And to keep track or distinguish a key/value pair of that linked list we use a unique "encryption key" which is associated with every key/value pair of that linked list. This "encryption key" is generated from the same hash function which hashes the simple key to hashed-key. The term DHT which was used earlier is just the concept of hashing a key and then storing its value somewhere. We have already discussed this hashing and storing in detail above.
+  Above we discussed how the data is stored on the active machines of the identifier space but what if more than one key hashes to a same id(eg. consider "Awesome Game" & "Good Movie" now both hash to value of 10)? In order solve this problem we use the concept of chaining lists. Every node of the binary search tree of a machine holds a singly linked list instead of just holding a single key/value pair. Whenever more than two keys hash to the same id they are inserted in the relevant linked list of BST(Binary Search Tree) of the machine. And to keep track or distinguish a key/value pair of that linked list we use a unique "encryption key" which is associated with every key/value pair of that linked list. This "encryption key" is generated from the same hash function which hashes the simple key to hashed-key. The term DHT which was used earlier is just the concept of hashing a key and then storing its value somewhere. We have already discussed this hashing and storing in detail above.
 </p>
 <br/><br/>
 <h2>Development Team</h2>