Add day 34

Author: MadhavBahl

README.md

@@ -61,6 +61,7 @@ Motivate yourself to code daily till 60 days, and see the magic! Coding will bec
 | [Day 31](./day31) | [Bubble Sort](./day31) | [http://codetoexpress.tech/dc/day31/](http://codetoexpress.tech/dc/day31/) | **Beginner** |
 | [Day 32](./day32) | [Selection Sort](./day32) | [http://codetoexpress.tech/dc/day32/](http://codetoexpress.tech/dc/day32/) | **Intermediate** |
 | [Day 33](./day32) | [Insertion Sort](./day33) | [http://codetoexpress.tech/dc/day33/](http://codetoexpress.tech/dc/day33/) | **Beginner** |
+| [Day 34](./day34) | [Merge Sort](./day34) | [http://codetoexpress.tech/dc/day34/](http://codetoexpress.tech/dc/day34/) | **Intermediate** |
 
 ## [More Problems](./BONUS/README.md)
 

day34/JavaScript/mergeSort.js

@@ -0,0 +1 @@
+// To be added

day34/README.md

@@ -0,0 +1,28 @@
+![cover](./cover.png)
+
+# Day 34 - Search and Sort Algorithms Part G: Merge Sort
+
+Now that we have come this far in searching and sorting algorithms, let's look at a few more algorithms for a couple of days and then we will proceed with questions on data structures like linked lists (singly linked and doubly linked), stacks, queues, trees etc. So today, try to implement merge sort.
+
+Referance: https://www.geeksforgeeks.org/merge-sort/
+
+## Question
+
+**Type:** Divide and Conquer
+
+Given an unsorted list of elements, write a program to sort the given list using merge sort.
+
+**Example**
+
+```
+input: [1, 5, 2, 7, 3, 4, 8, 9, 6]
+output: [1, 2, 3, 4, 5, 6, 7, 8, 9]
+```
+
+## Solution
+
+### [JavaScript Implementation](./JavaScript/mergeSort.js)
+
+```js
+to be added
+```