Update README.md

Signed-off-by: Fabiana  ⚡️ Campanari <113218619+FabianaCampanari@users.noreply.github.com>

Author: FabianaCampanari

README.md

@@ -2027,9 +2027,7 @@ v_1 &= 12, \quad v_2 = 18, \quad v_3 = 24 \\
 
 <br>
 
----\\\ UNDER CONTR🚛🚛🚛
-
-### **3.2 Compute Reduced Costs Again**  
+#### [3.2](). Compute Reduced Costs Again 
 
 <br>
 
@@ -2042,20 +2040,26 @@ v_1 &= 12, \quad v_2 = 18, \quad v_3 = 24 \\
 
 <br>
 
-#### [**Conclusion**](): Negative reduced costs ($x_{12}$, $x_{13}$, $x_{23}$) mean the solution is **still not optimal**. Further iterations are required.
+### [**Conclusion**](): Negative reduced costs ($x_{12}$, $x_{13}$, $x_{23}$) mean the solution is **still not optimal**. Further iterations are required.
 
 <br>
 
-## Final Iteration (Optimal Solution)
+## [Step 4]():  Final Iteration  (Optimal Solution)
+
+#### [4.1](). Select Entering Variable 
 
-### [4.1](). Select Entering Variable**  
+<br>
 
 Most negative reduced cost: $\bar{c}_{13} = -6$.  
 
-**Entering variable:** $x_{13}$.
+<br>
+
+Entering variable:** $x_{13}$.
 
 <br>
 
+🏄🏄🏄🏄
+
 #### [4.2](). Construct the Closed Loop
 
 - **Loop Path**: $ x_{13} \rightarrow x_{33} \rightarrow x_{31} \rightarrow x_{11} \rightarrow x_{13} $.