From 6b35f068ec873ea0618261efc3cbf2c49a79440c Mon Sep 17 00:00:00 2001
From: Augusto <aug.ornelas@gmail.com>
Date: Sun, 10 Oct 2021 23:19:21 +0100
Subject: [PATCH] Add specific dependencies and fix spelling mistakes

---
 subjects/bigger/README.md            | 4 ++++
 subjects/card_deck/README.md         | 4 ++++
 subjects/events/README.md            | 4 ++++
 subjects/road_intersection/README.md | 4 ++--
 subjects/spelling/README.md          | 4 ++++
 5 files changed, 18 insertions(+), 2 deletions(-)

diff --git a/subjects/bigger/README.md b/subjects/bigger/README.md
index 11e1b175c..ef8d4fa01 100644
--- a/subjects/bigger/README.md
+++ b/subjects/bigger/README.md
@@ -8,6 +8,10 @@ Create the function `bigger` that gets the biggest positive number in the `HashM
 
 [hash maps](https://doc.rust-lang.org/book/ch08-03-hash-maps.html)
 
+### Dependencies
+
+rand = "0.7"
+
 ### Expected Function
 
 ```rust
diff --git a/subjects/card_deck/README.md b/subjects/card_deck/README.md
index 1ad7631df..76e92d241 100644
--- a/subjects/card_deck/README.md
+++ b/subjects/card_deck/README.md
@@ -28,6 +28,10 @@ Define:
 [Crate rand](https://docs.rs/rand/0.3.14/rand/)
 [Enums](https://doc.rust-lang.org/book/ch06-00-enums.html)
 
+### Dependencies
+
+rand = "0.3.14"
+
 ### Expected Functions and Structures
 
 ```rust
diff --git a/subjects/events/README.md b/subjects/events/README.md
index 4ea9cf184..1158f2ab4 100644
--- a/subjects/events/README.md
+++ b/subjects/events/README.md
@@ -45,6 +45,10 @@ These events can be: Remainders, Registrations, Appointments or Holidays.
 - [colored crate](https://docs.rs/colored/2.0.0/colored/)
 - [chrono crate](https://crates.io/crates/chrono)
 
+### Dependencies
+
+chrono = "0.4"
+
 ### Expected Functions and Data Structures
 
 ```rust
diff --git a/subjects/road_intersection/README.md b/subjects/road_intersection/README.md
index 1e05d3ccc..23c413a69 100644
--- a/subjects/road_intersection/README.md
+++ b/subjects/road_intersection/README.md
@@ -48,7 +48,7 @@ For clarification reasons we will assume that a lane can have three different ro
 
 2. Traffic lights
 
-Traffic lights are signalling devices positioned at road intersections that follows an universal color code,
+Traffic lights are signalize devices positioned at road intersections that follows an universal color code,
 normally its green, red and amber, but for this project you will just use the colors **red** and **green**.
 
 You will then have to create some kind of representation for the traffic lights and distribute them for each lane in the intersection.
@@ -72,7 +72,7 @@ Vehicles must obey this rules:
 
 - Each vehicle must have a fixed velocity.
 
-- It must be kept a safety distance from other vehicles, if one vehicle stops the other vehicle thats
+- It must be kept a safety distance from other vehicles, if one vehicle stops the other vehicle that
   behind him must stop and keep its distance.
 
 - Vehicles must stop if the traffic light is red and proceed otherwise.
diff --git a/subjects/spelling/README.md b/subjects/spelling/README.md
index 0b677b1fa..1f88663e2 100644
--- a/subjects/spelling/README.md
+++ b/subjects/spelling/README.md
@@ -22,6 +22,10 @@ Only positive numbers will be tested. (Up to a million).
 
 - [patterns](https://doc.rust-lang.org/book/ch18-00-patterns.html)
 
+### Dependencies
+
+rand = "0.7"
+
 ### Expected function
 
 ```rust