From 6db4a71d44651ade13265c6a332663d9fbff64e3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fabiana=20=20=E2=9A=A1=EF=B8=8F=20Campanari?=
 <113218619+FabianaCampanari@users.noreply.github.com>
Date: Sun, 3 Aug 2025 13:23:17 -0300
Subject: [PATCH] Update README.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: Fabiana  ⚡️ Campanari <113218619+FabianaCampanari@users.noreply.github.com>
---
 README.md | 21 +++++++++++++++------
 1 file changed, 15 insertions(+), 6 deletions(-)

diff --git a/README.md b/README.md
index 0d02558..8eab8e2 100644
--- a/README.md
+++ b/README.md
@@ -2189,14 +2189,16 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
 
 <br>
 
-- [Row 1 min: 2[() → [0, 2, 1]
-- [Row 2 min: 1[() → [0, 2, 1]
-- [Row 3 min: 2[() → [3, 0, 2]
+- [Row 1 min: 2]() → [0, 2, 1]
+- [Row 2 min: 1]() → [0, 2, 1]
+- [Row 3 min: 2]() → [3, 0, 2]
 
 <br>
 
 #### [Matrix after row subtraction]():
 
+<br>
+
 |         | M1 | M2 | M3 |
 |---------|----|----|----|
 | Task 1  |  0 |  2 |  1 |
@@ -2206,16 +2208,23 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
 
 <br>
 
-### [**Step 2](): Subtract Column Minimums**
+### [Step 2](): Subtract Column Minimums
 
-### Problem Recap
+### [Problem Recap]():
+
+<br>
 
 - **3 tasks** must be assigned to **3 machines**.
 - Each task can be done by any machine, but with different costs.
 - Each task must be assigned to exactly one machine, and each machine to exactly one task.
 - **Goal:** Minimize total assignment cost.
 
-### Cost Table
+<br>  
+
+### [Cost Table]():
+
+<br>
+
 
 |         | Machine 1 | Machine 2 | Machine 3 |
 |---------|-----------|-----------|-----------|