diff --git a/ASD_Task_2.depend b/ASD_Task_2.depend
index 4a87b2d..90c1e87 100644
--- a/ASD_Task_2.depend
+++ b/ASD_Task_2.depend
@@ -29,3 +29,21 @@
 	"list.h"
 	"operation.h"
 
+1581170938 source:d:\kuliah\semester 2\asd_task_2\operation.cpp
+	"list.h"
+	"operation.h"
+
+1580809364 d:\kuliah\semester 2\asd_task_2\list.h
+	<iostream>
+
+1580808708 d:\kuliah\semester 2\asd_task_2\operation.h
+	"list.h"
+
+1581170877 source:d:\kuliah\semester 2\asd_task_2\main.cpp
+	<iostream>
+	"list.h"
+	"operation.h"
+
+1581170715 source:d:\kuliah\semester 2\asd_task_2\list.cpp
+	"list.h"
+
diff --git a/ASD_Task_2.layout b/ASD_Task_2.layout
index e69ac9c..51663f5 100644
--- a/ASD_Task_2.layout
+++ b/ASD_Task_2.layout
@@ -4,22 +4,22 @@
 	<ActiveTarget name="Debug" />
 	<File name="operation.cpp" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="656" topLine="0" />
+			<Cursor1 position="516" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="Main.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="list.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="837" topLine="23" />
+			<Cursor1 position="3161" topLine="124" />
 		</Cursor>
 	</File>
-	<File name="list.h" open="1" top="1" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="list.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="151" topLine="0" />
+			<Cursor1 position="1309" topLine="30" />
 		</Cursor>
 	</File>
-	<File name="list.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="Main.cpp" open="1" top="1" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="214" topLine="117" />
+			<Cursor1 position="837" topLine="21" />
 		</Cursor>
 	</File>
 	<File name="operation.h" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
diff --git a/Main.cpp b/Main.cpp
index 297d6ca..ec0a239 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..9d8ff14
Binary files /dev/null and b/bin/Debug/ASD_Task_2.exe differ
diff --git a/list.cpp b/list.cpp
index f61d73d..eaab829 100644
--- a/list.cpp
+++ b/list.cpp
@@ -5,7 +5,7 @@ void createList(List &L) {
     * FS : set first(L) with Null
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    L.first = NULL;
 
 
     //----------------------------------------
@@ -16,10 +16,10 @@ address allocate(infotype x) {
     * FS : return new list element with info = x and next element is Null
     */
 
-    address P = NULL;
+    address P = new elmlist;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    P -> info = x;
+    P -> next = NULL;
 
     //----------------------------------------
     return P;
@@ -30,9 +30,7 @@ void deallocate(address &P) {
     * FS : delete element pointed by P
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
-
+    delete P;
     //----------------------------------------
 }
 
@@ -42,10 +40,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;
-
-
-
+    P -> next = L.first;
+    L.first = P;
     //----------------------------------------
 }
 
@@ -55,9 +51,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 = L.first;
+    while(Q -> next != NULL){
+        Q = Q -> next;
+    }
+    Q -> next = P;
     //----------------------------------------
 }
 
@@ -70,11 +69,15 @@ address findElm(List L, infotype x) {
 
     address P;
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
+    P = L.first;
+    while (P != NULL && P->info != x)
+    {
+        P = P -> next;
+    }
+    return P;
 
 
     //----------------------------------------
-    return P;
 }
 
 void deleteFirst(List &L, address &P) {
@@ -83,10 +86,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 (L.first != NULL){
+        P = L.first;
+        L.first = P -> next;
+        P -> next = NULL;
+    }
     //----------------------------------------
 }
 
@@ -96,10 +100,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 = L.first;
+    if (Q -> next == NULL){
+        deleteFirst(L,Q);
+    } else {
+        while((Q -> next)->next != NULL){
+            Q = Q -> next;
+        }
+        P = Q -> next;
+        Q -> next = NULL;
+    }
     //----------------------------------------
 }
 
@@ -109,9 +120,11 @@ 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 Q = L.first;
+    while (Q != NULL){
+        cout<<Q -> info<<", ";
+        Q = Q -> next;
+    }
     //----------------------------------------
     cout<<endl;
 }
@@ -124,8 +137,8 @@ void insertAfter(List &L, address Prec, address P) {
     *      pointed by pointer Prec
     */
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    P -> next = Prec -> next;
+    Prec -> next = P;
     //----------------------------------------
 
 }
@@ -136,8 +149,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 = Prec -> next;
+    Prec -> next = P -> next;
+    P -> next = 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..2838b6d
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..201ee28 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..d706d5e 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..a829012 100644
--- a/operation.cpp
+++ b/operation.cpp
@@ -13,8 +13,17 @@ void insert_sorted(List &L, infotype x) {
     */
 
     //-------------your code here-------------
-    cout<<"your code here"<<endl;
-
+    address P, Q;
+    P = L.first;
+    if (P == NULL || P->info > x) {
+        insertFirst(L, allocate(x));
+    } else if (findElm(L, x) == NULL) {
+        while (P != NULL && P->info < x) {
+            Q = P;
+            P = P->next;
+        }
+        insertAfter(L, Q, allocate(x));
+    }
 
     //----------------------------------------
 }