Update README.md

Author: ayushs1ngh

Practice Problems/Backtracking/Rat In A Maze/README.md

@@ -4,7 +4,7 @@
 A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach the destination. The rat can move only in two directions: forward and down.
 In the maze matrix, 0 means the block is a dead end and 1 means the block can be used in the path from source to destination. Note that this is a simple version of the typical Maze problem. For example, a more complex version can be that the rat can move in 4 directions and a more complex version can be with a limited number of moves. 
 
-Algorithm:
+**Algorithm:**
 If destination is reached
     print the solution matrix
 Else
@@ -37,10 +37,10 @@ The 1 values show the path of rat.
 ```
 
 
-Complexity Analysis:
+### Complexity Analysis:
 
-Time Complexity: O(2^(n^2)).
+**Time Complexity:** O(2^(n^2)).
 The recursion can run upperbound 2^(n^2) times.
 
-Space Complexity: O(n^2).
+**Space Complexity:** O(n^2).
 Output matrix is required so an extra space of size n*n is needed.