diff --git a/README.md b/README.md
index 0663bde..7946439 100644
--- a/README.md
+++ b/README.md
@@ -60,9 +60,11 @@ _______________________________________________________________________________
 
 NOTE:
 - OME: Out of Memory Error
-- For insertionSort(), with n = 1 Million, we got Time = 349689, which is far more than 2 minutes limit. So, it is considered to be Infinite. And for rest of the input values, it is even more than the above value, hence considered Infinite as well.
-- Due to longer execution time for insertionSort(), *numTrials = 5* was set. And for rest of the mergeSort() versions we had *numTrials = 100*.
-- The threshold values were T2 = 99, T3 = 99 as we computed above results. Later on, we found the optimal value for both the threshold values, which can be seen in the [report](https://github.com/rahul1947/SP09-Divide-and-Conquer/blob/master/sp9.pdf). 
+- For insertionSort(), with n = 1 Million, we got Time = 349689 msec, which is far more than 2 minutes as time limit. So, it is considered to be Infinite. And for rest of the input values, it is even more than the limit, hence they were considered Infinite as well. 
+- Due to longer execution time for insertionSort(), *numTrials = 5* was set for it. And for rest of the mergeSort() versions we had *numTrials = 100*.
+- Existing Processor: **Intel® Core™ i5-8250U CPU @ 1.60GHz × 8**. 
+  Memory: **7.5 GiB**
+- The threshold values were T2 = 99 and T3 = 99, as we computed above results. Later on, we found the optimal threshold values, which can be seen in the [report](https://github.com/rahul1947/SP09-Divide-and-Conquer/blob/master/sp9.pdf). 
 
 
 #### Optional Task (individual): 
diff --git a/sp9-dac-2018.txt b/sp9-dac-2018.txt
deleted file mode 100644
index 6e12e8f..0000000
--- a/sp9-dac-2018.txt
+++ /dev/null
@@ -1,33 +0,0 @@
-Implementation of data structures and algorithms
-Fall 2018
-Short Project 9: Divide and conquer algorithms
-Thu, Oct 25, 2018
-
-Version 1.0: Initial description (Thu, Oct 11).
-
-Due: 11:59 PM, Sun, Nov 4.
-
-Submission procedure: same as usual.
-
-
-Team task:
-1. Implement and compare the running times of the following algorithms
-   on randomly generated arrays: (a) Insertion sort, (b) Merge sort (take 1),
-   (c) Merge sort (take 2), (d) Merge sort (take 3).
-   Do not run more than one algorithm in each trial.
-   For Insertion sort, if the running time exceeds 2 min, write the time as infinity.
-   For Merge sort, in each trial, run only one algorithm, for one value of n, 100 times
-   in a loop, and taking the average time.
-   Try the following values of n: 8M, 16M, 32M, 64M, ..., until you get out of memory exception.
-   Submit a report with your observations.  Starter code is provided.
-
-
-Individual task (optional):
-
-2. Use BigInteger class and write programs to computer f(n), the nth Fibonacci number.
-   Implement the O(n) algorithm and the O(log n) algorithm.  Compare their running times
-   for the following values of n: 1000, 10000, 100000.  Since printing the output
-   takes a lot of time, stop the timer before starting to print the output.
-   In each trial, run only one algorithm, for just one value of n.
-   At the top of your source file, write the observations within /* ... */ comments.
-