diff --git a/.vscode/c_cpp_properties.json b/.vscode/c_cpp_properties.json
new file mode 100644
index 0000000..1df4412
--- /dev/null
+++ b/.vscode/c_cpp_properties.json
@@ -0,0 +1,17 @@
+{
+    "configurations": [
+        {
+            "name": "Win32",
+            "includePath": [
+                "${workspaceFolder}/**"
+            ],
+            "defines": [
+                "_DEBUG",
+                "UNICODE",
+                "_UNICODE"
+            ],
+            "intelliSenseMode": "msvc-x64"
+        }
+    ],
+    "version": 4
+}
\ No newline at end of file
diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..3fa552f 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -29,3 +29,21 @@
 	"list.h"
 	"operation.h"
 
+1581236071 source:c:\users\ikramsinapoy\documents\asd_task_2\list.cpp
+	"list.h"
+
+1581236071 c:\users\ikramsinapoy\documents\asd_task_2\list.h
+	<iostream>
+
+1581236071 source:c:\users\ikramsinapoy\documents\asd_task_2\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+
+1581167771 c:\users\ikramsinapoy\documents\asd_task_2\operation.h
+	"list.h"
+
+1581236071 source:c:\users\ikramsinapoy\documents\asd_task_2\operation.cpp
+	"list.h"
+	"operation.h"
+
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..f3dfaf8 100644
--- a/Main.cpp
+++ b/Main.cpp
@@ -34,7 +34,7 @@ int main() {
     //==================================================
     // TEST INSERT AFTER
     P = findElm(L, 6);
-    insertLast(L, allocate(5));
+    insertAfter(L, P, allocate(5));
     printInfo(L);
     cout<<"output should be: 8, 3, 6, 5, 4, 2,"<<endl;
 
diff --git a/bin/Debug/ASD_Task_2.exe b/bin/Debug/ASD_Task_2.exe
new file mode 100644
index 0000000..20c7e55
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..f7f6ebb 100644
--- a/list.cpp
+++ b/list.cpp
@@ -5,9 +5,7 @@ void createList(List &L) {
     * FS : set first(L) with Null
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    first(L) = NULL;
     //----------------------------------------
 }
 
@@ -18,9 +16,9 @@ address allocate(infotype x) {
 
     address P = NULL;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
     //----------------------------------------
     return P;
 }
@@ -30,9 +28,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    delete P;
     //----------------------------------------
 }
 
@@ -42,10 +38,8 @@ void insertFirst(List &L, address P) {
     * FS : element pointed by P became the first element in List L
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
-
+    next(P) = first(L);
+    first(L) = P;
     //----------------------------------------
 }
 
@@ -55,9 +49,12 @@ void insertLast(List &L, address P) {
     * FS : element pointed by P became the last element in List L
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    address Q;
+    Q = first(L);
+    while(next(Q)!=NULL){
+        Q = next(Q);
+    }
+    next(Q)= P;
     //----------------------------------------
 }
 
@@ -70,9 +67,11 @@ address findElm(List L, infotype x) {
 
     address P;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    P = first(L);
 
+    while ((P != NULL ) && (info(P)!= x)){
+        P = next(P);
+    }
     //----------------------------------------
     return P;
 }
@@ -83,7 +82,11 @@ void deleteFirst(List &L, address &P) {
     * FS : first element in List L is removed and is pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    if (first(L) != NULL){
+        P = first(L);
+        first(L) = next(P);
+        next(P) = NULL;
+    }
 
 
 
@@ -96,10 +99,17 @@ void deleteLast(List &L, address &P) {
     * FS : last element in List L is removed and is pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
-
+    address Q;
+    Q = first(L);
+    if (next(Q) == NULL){
+       deleteFirst(L,P);
+    } else {
+        while (next(next(Q))!= NULL ){
+            Q = next(Q);
+        }
+        P = next(Q);
+        next(Q) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -109,9 +119,12 @@ void printInfo(List L) {
     *      call the view_data function from my_data.h to print the info
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    address P;
+    P = first(L);
+    while(P!=NULL){
+        cout<<info(P)<<" , ";
+        P = next(P);
+    }
     //----------------------------------------
     cout<<endl;
 }
@@ -124,7 +137,8 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    next(P) = next(Prec);
+    next(Prec) = P;
 
     //----------------------------------------
 
@@ -136,9 +150,9 @@ void deleteAfter(List &L, address Prec, address &P) {
     *      is removed and pointed by pointer P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    P = next(Prec);
+    next(Prec) = next(P);
+    next(P) = NULL;
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index d021225..be28827 100644
--- a/list.h
+++ b/list.h
@@ -30,14 +30,14 @@ typedef struct elmlist *address;
 
 struct elmlist{
     //------------- your code here -----------
-
-
+    infotype info;
+    address next;
     //----------------------------------------
 };
 
 struct List{
     //------------- your code here -----------
-
+    address first;
     //----------------------------------------
 };
 
diff --git a/obj/Debug/Main.o b/obj/Debug/Main.o
new file mode 100644
index 0000000..7353acd
Binary files /dev/null and b/obj/Debug/Main.o differ
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
index f0e2f8e..307328f 100644
Binary files a/obj/Debug/list.o and b/obj/Debug/list.o differ
diff --git a/obj/Debug/operation.o b/obj/Debug/operation.o
index b08b1f9..c3f907b 100644
Binary files a/obj/Debug/operation.o and b/obj/Debug/operation.o differ
diff --git a/operation.cpp b/operation.cpp
index 0a0e067..82dd615 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -13,7 +13,24 @@ void insert_sorted(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    address Q,P;
+    if ((first(L) == NULL) || (x < info(first(L)))) {
+        P = allocate(x);
+        insertFirst(L,P);
+    } else {
+        Q = first(L);
+        while ((next(Q)!= NULL) && (x > info(next(Q)))){
+            Q = next(Q);
+        }
+        if (next(Q) == NULL){
+            P = allocate(x);
+            insertLast(L,P);
+        }else if (info(P)!=info(Q)){
+            P = allocate(x);
+            insertAfter(L,P,Q);
+        }
+    }
+
 
 
     //----------------------------------------