diff --git a/UFCFVQ-15-M Programming Task 1.ipynb b/UFCFVQ-15-M Programming Task 1.ipynb
index 3a3c6233984578fb06678438ea4982c0666ee5a3..bc24d6dadcb3893b4fc77d65feeae04da7d2d085 100644
--- a/UFCFVQ-15-M Programming Task 1.ipynb	
+++ b/UFCFVQ-15-M Programming Task 1.ipynb	
@@ -7617,16 +7617,16 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Explanation\n",
+    "### 1)Explanation\n",
     "\n",
-    "#### From task 1.1 to 1.7\n",
+    "#### 1.1) From task 1.1 to 1.7\n",
     "\n",
     "- Overall the questions can be solved using mathematical equations using a pre-build function in python.\n",
     "- All questions are straight to the point.\n",
     "- All questions have been solved using task1.dot file\n",
     "\n",
-    "#### From task 1.9 and along\n",
-    "##### Explanation 1 \n",
+    "#### 1.2) From task 1.9 and along\n",
+    "##### 1.2.1) Explanation 1 \n",
     "- The normal data structure example is as shown \n",
     "\n",
     "    ['A','B','C'],\n",
@@ -7640,26 +7640,26 @@
     "\n",
     "- Therefore variable ListOfData will result to have the data in this shape = [['A','1','4'..],[['B','2','5'..]]..]\n",
     "\n",
-    "##### Explanation 2\n",
+    "##### 1.2.2) Explanation 2\n",
     "- For loop is created to reach out to every single data inside 'ListOfData' in the range of the data length, (768) or (767) if we count from 0. therefore it will start from [0][0].. [1][0].. [2][0] until it reaches [767][0] and switch to [0][1].. and continue until it reaches the last data in the file which is at [767][8]. while so, the data will be appended to a new list called 'ListOfData' as explained in explanation 1.\n",
     "\n",
     "\n",
-    "### Strength\n",
+    "### 2) Strength\n",
     "\n",
     "- Some of the functions can be reused again in different phases\n",
     "- The tasks are connected all together and take results from each other without the need to re-write all from scratch\n",
     "\n",
-    "### Weaknesses\n",
+    "### 3) Weaknesses\n",
     "\n",
     "- The limitation of library use made the tasks take longer lines to be solved, which can be limited if python libraries such as CSV, and Pandas are used the whole prosses would be solved with shorter lines of coding and with less time to execute.\n",
     "\n",
-    "### Improvement Points\n",
+    "### 4) Improvement Points\n",
     "\n",
     "- Any python program can be improved and can be written in fewer lines.\n",
     "- The custom table can be improved and created with a better algorithm using better formatting.\n",
     "- The tasks from 1.1 to 1.7 can be updated to be solved using pure python, without the use of pre-build python functions. \n",
     "\n",
-    "### Alternative\n",
+    "### 5) Alternative\n",
     "\n",
     "- Some of the mathematical equations such as STD can be solved using another equation.\n",
     "- Instead of using python pre-build functions such as sum and len, for loop can be used to provide the same result. \n",