reword hashmaps2 a bit more

Author: liv

exercises/hashmaps/hashmaps2.rs

@@ -1,10 +1,12 @@
 // hashmaps2.rs
-// A basket of fruits in the form of a hash map is given. The key
-// represents the name of the fruit and the value represents how many
-// of that particular fruit is in the basket. 
-// Three types of fruits - Apple (4), Mango (2) and Lychee (5) are already given in the basket. 
-// You must add fruit to the basket so that there is at least 
-// one of each kind and more than 11 in total.
+// We're collecting different fruits to bake a delicious fruit cake.
+// For this, we have a basket, which we'll represent in the form of a hash
+// map. The key represents the name of each fruit we collect and the value
+// represents how many of that particular fruit we have collected.
+// Three types of fruits - Apple (4), Mango (2) and Lychee (5) are already
+// in the basket hash map.
+// You must add fruit to the basket so that there is at least
+// one of each kind and more than 11 in total - we have a lot of mouths to feed.
 // You are not allowed to insert any more of these fruits!
 //
 // Make me pass the tests!
@@ -34,7 +36,7 @@ fn fruit_basket(basket: &mut HashMap<Fruit, u32>) {
     ];
 
     for fruit in fruit_kinds {
-        // TODO: Insert new fruits if they are not already present in the basket. 
+        // TODO: Insert new fruits if they are not already present in the basket.
         // Note that you are not allowed to put any type of fruit that's already
         // present!
     }