diff --git a/ASD_Task_4.depend b/ASD_Task_4.depend
index a544662..ed4fe06 100644
--- a/ASD_Task_4.depend
+++ b/ASD_Task_4.depend
@@ -19,3 +19,23 @@
 	"player.h"
 	<ctime>
 
+1583564997 source:c:\users\azizah cahya\documents\github\asd_task_4\main.cpp
+	"player.h"
+	"list.h"
+	<conio.h>
+
+1583558502 c:\users\azizah cahya\documents\github\asd_task_4\player.h
+	"list.h"
+
+1583561694 c:\users\azizah cahya\documents\github\asd_task_4\list.h
+	<string>
+	<windows.h>
+	<iostream>
+
+1583570330 source:c:\users\azizah cahya\documents\github\asd_task_4\player.cpp
+	"player.h"
+	<ctime>
+
+1583564795 source:c:\users\azizah cahya\documents\github\asd_task_4\list.cpp
+	"list.h"
+
diff --git a/ASD_Task_4.layout b/ASD_Task_4.layout
index 5ec49e7..7b65762 100644
--- a/ASD_Task_4.layout
+++ b/ASD_Task_4.layout
@@ -2,29 +2,29 @@
 <CodeBlocks_layout_file>
 	<FileVersion major="1" minor="0" />
 	<ActiveTarget name="Debug" />
-	<File name="main.cpp" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="player.cpp" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="4763" topLine="177" />
+			<Cursor1 position="253" topLine="39" />
 		</Cursor>
 	</File>
-	<File name="player.h" open="1" top="1" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="player.h" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
 			<Cursor1 position="342" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="list.cpp" open="1" top="0" tabpos="4" 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="2436" topLine="0" />
+			<Cursor1 position="270" topLine="0" />
 		</Cursor>
 	</File>
-	<File name="player.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="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="253" topLine="39" />
+			<Cursor1 position="4763" topLine="177" />
 		</Cursor>
 	</File>
-	<File name="list.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
+	<File name="list.cpp" open="1" top="1" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 		<Cursor>
-			<Cursor1 position="270" topLine="0" />
+			<Cursor1 position="2438" topLine="78" />
 		</Cursor>
 	</File>
 </CodeBlocks_layout_file>
diff --git a/bin/Debug/ASD_Task_4.exe b/bin/Debug/ASD_Task_4.exe
new file mode 100644
index 0000000..14fd957
Binary files /dev/null and b/bin/Debug/ASD_Task_4.exe differ
diff --git a/list.cpp b/list.cpp
index 847a957..987d709 100644
--- a/list.cpp
+++ b/list.cpp
@@ -5,7 +5,7 @@ void createList(List &L) {
     * FS : first(L) diset Nil
     */
     //------------- YOUR CODE HERE -------------
-
+    first(L) = NULL;
     //----------------------------------------
 }
 
@@ -17,7 +17,10 @@ address allocate(infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+    P = new elmlist;
+    info(P).ID = x.ID;
+    info(P).location = x.location;
+    info(P).name = x.name;
     //----------------------------------------
     return P;
 }
@@ -27,7 +30,7 @@ void deallocate(address &P) {
     * FS : menghapus elemen yang ditunjuk oleh P (delete)
     */
     //------------- YOUR CODE HERE -------------
-
+    delete P;
     //----------------------------------------
 }
 
@@ -37,7 +40,17 @@ void insertFirst(List &L, address P) {
     * FS : elemen yang ditunjuk P menjadi elemen pertama pada List L
     */
     //------------- YOUR CODE HERE -------------
-
+    if (first(L) == NULL){
+        first(L) = P;
+        next(first(L)) = P;
+        prev(first(L)) = P;
+    }else{
+        next(P) = first(L);
+        next(prev(first(L))) = P;
+        prev(P) = prev(first(L));
+        prev(first(L)) = P;
+        first(L) = P;
+     }
     //----------------------------------------
 }
 
@@ -47,7 +60,17 @@ void insertLast(List &L, address P) {
     * FS : elemen yang ditunjuk P menjadi elemen terakhir pada List L
     */
     //------------- YOUR CODE HERE -------------
-
+    if(first(L) == NULL){
+        first(L) = P;
+        next(first(L)) = P;
+        prev(first(L)) = P;
+    }else {
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        next(prev(first(L))) = P;
+        prev(first(L)) = P;
+
+    }
     //----------------------------------------
 }
 
@@ -60,7 +83,18 @@ address findElmByID(List L, infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+    if(first(L) == NULL){
+        cout<<"List Kosong"<<endl;
+    }else{
+        P = first(L);
+        do{
+            if(info(P).ID == x.ID){
+                return P;
+            }
+            P = next(P);
+        }while(P != first(L));
+        P = NULL;
+    }
     //----------------------------------------
     return P;
 }
@@ -74,7 +108,18 @@ address findElmByName(List L, infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+    if(first(L) == NULL){
+        cout<<"List Kosong"<<endl;
+    }else{
+        P = first(L);
+        do{
+            if(info(P).name == x.name){
+                return P;
+            }
+            P = next(P);
+        }while(P != first(L));
+        P = NULL;
+    }
     //----------------------------------------
     return P;
 }
@@ -85,7 +130,20 @@ void deleteFirst(List &L, address &P) {
     * FS : elemen pertama di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    P = first(L);
+    if(first(L) == NULL){
+        cout<<" "<<endl;
+    }else if(next(first(L) == first(L))){
+        next(P) = NULL;
+        prev(P) = NULL;
+        first(L) = NULL;
+    }else{
+        first(L) = next(P);
+        next(prev(P)) = first(L);
+        prev(first(L)) = prev(P);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -95,7 +153,20 @@ void deleteLast(List &L, address &P) {
     * FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    P = first(L);
+    if(first(L) == NULL){
+        cout<<" "<<endl;
+    }else if(next(first(L)) == NULL){
+        first(L) = NULL;
+        next(P) = NULL;
+        prev(P) = NULL;
+    }else{
+        P = prev(P);
+        next(prev(P)) = first(L);
+        prev(first(L)) = prev(P);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -106,7 +177,10 @@ void insertAfter(List &L, address &Prec, address P) {
     *      ditunjuk pointer Prec
     */
     //------------- YOUR CODE HERE -------------
-
+    next(Prec) = next(P);
+    prev(Prec) = P;
+    prev(next(P)) = Prec;
+    next(P) = Prec;
     //----------------------------------------
 
 }
@@ -117,7 +191,24 @@ void deleteAfter(List &L, address &Prec, address &P) {
     *      dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if(Prec == first(L) && next(Prec) == first(L)){
+        first(L) = NULL;
+        next(Prec) = NULL;
+        prev(Prec) = NULL;
+    }else if(next(Prec) == first(L)){
+        P = first(L);
+        next(Prec) = next(P);
+        prev(next(P)) = Prec;
+        first(L) = next(P);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }else{
+        P = next(Prec);
+        next(Prec) = next(P);
+        prev(next(P)) = Prec;
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index 4468d0f..8a564d5 100644
--- a/list.h
+++ b/list.h
@@ -29,14 +29,16 @@ typedef struct elmlist *address;
 
 struct elmlist {
     //-------------  YOUR CODE HERE  -----------
-
+    music info;
+    address next;
+    address prev;
 
     //----------------------------------------
 };
 
 struct List {
     //-------------  YOUR CODE HERE  -----------
-
+    address first;
 
     //----------------------------------------
 };
diff --git a/main.cpp b/main.cpp
index a66a5c1..ea4b647 100644
--- a/main.cpp
+++ b/main.cpp
@@ -122,9 +122,8 @@ void runMenu(int menu) {
     case 2:
         // insert last music
         //------------- YOUR CODE HERE -------------
-        cout<<"UNDER MAIN TENIS"<<endl;
-        //input music
-        //insertLast()
+        P = inputMusic();
+        insertLast(L, P);
 
         //----------------------------------------
         cout<<"press enter";getche();
@@ -142,7 +141,8 @@ void runMenu(int menu) {
     case 5:
         // play last music
         //------------- YOUR CODE HERE -------------
-        cout<<"UNDER MAIN TENIS"<<endl;
+        P = prev(first(L));
+        playMusic(P);
 
         //----------------------------------------
         break;
@@ -154,6 +154,8 @@ void runMenu(int menu) {
         P = findElmByName(L, x);
         if(P != NULL){
             cout<<"music found"<<endl;
+        }else{
+            cout<<"music not found"<<endl;
         }
         //----------------------------------------
         cout<<"press enter";getche();
@@ -161,7 +163,14 @@ void runMenu(int menu) {
     case 7:
         // search music by ID
         //------------- YOUR CODE HERE -------------
-        cout<<"UNDER MAIN TENIS"<<endl;
+        cout<<"input music id : ";
+        cin>>x.ID;
+        P = findElmByID(L, x);
+        if(P != NULL){
+            cout<<"music found"<<endl;
+        }else{
+            cout<<"music not found"<<endl;
+        }
 
         //----------------------------------------
         cout<<"press enter";getche();
@@ -182,8 +191,10 @@ void runMenu(int menu) {
     case 10:
         // play previous music
         //------------- YOUR CODE HERE -------------
-        cout<<"UNDER MAIN TENIS"<<endl;
-
+        if(P != NULL){
+            P = prev(P);
+            playMusic(P);
+            }
         //----------------------------------------
         break;
     case 11:
@@ -202,7 +213,7 @@ void runMenu(int menu) {
     case 13:
         // delete music by ID
         cout<<"input music ID : ";
-        cin>>x.name;
+        cin>>x.ID;
         deleteMusicByID(L, x);
         cout<<"press enter";getche();
         break;
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
new file mode 100644
index 0000000..40c11f4
Binary files /dev/null and b/obj/Debug/list.o differ
diff --git a/obj/Debug/main.o b/obj/Debug/main.o
new file mode 100644
index 0000000..6cf7834
Binary files /dev/null and b/obj/Debug/main.o differ
diff --git a/obj/Debug/player.o b/obj/Debug/player.o
new file mode 100644
index 0000000..9f1eb00
Binary files /dev/null and b/obj/Debug/player.o differ
diff --git a/player.cpp b/player.cpp
index 31ef288..d1904e7 100644
--- a/player.cpp
+++ b/player.cpp
@@ -12,7 +12,6 @@ void printInfo(List L) {
     * PR : menampilkan informasi ID, nama, dan lokasi file
     * YOU DON'T NEED TO MODIFY THIS
     */
-
     address Q = first(L);
     do {
         cout<<"name    : "<<info(Q).name<<endl
@@ -21,6 +20,7 @@ void printInfo(List L) {
         Q = next(Q);
     } while(Q!=first(L));
     cout<<"==============================================="<<endl;
+    
 }
 
 
@@ -43,8 +43,27 @@ void shuffleList(List &L) {
     * FS : isi (elemen) dari list teracak
     */
     //------------- YOUR CODE HERE -------------
+    int i = 0;
+    address Q;
+    address P = first(L);
+    do{
+        i = i + 1;
+        P = next(P);
+    }while(P !=first(L));
+    int random;
+    while(i > 0){
+        P = first(L);
+        random = randomInt(i);
+        int k = 1;
+        while(k != random ){
+            P = next(P);
+            k = k + 1;
+        }
+        deleteAfter(L, prev(P), Q);
+        insertLast(L, Q);
+        i = i - 1;
+    }
 
-        cout<<"UNDER MAIN TENIS"<<endl;
 
     //----------------------------------------
 }
@@ -55,8 +74,15 @@ void playRepeat(List &L, int n) {
     *      dari lagu pertama hingga terakhir sebanyak n kali
     */
     //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
+    int i = 0;
+    while(i < n){
+        address P = first(L);
+        do{
+            playMusic(P);
+            P = next(P);
+        }while(P != first(L));
+        i = i + 1;
+    }
 
     //----------------------------------------
 }
@@ -70,7 +96,18 @@ void deleteMusicByID(List &L, infotype x) {
     */
     //------------- YOUR CODE HERE -------------
 
-        cout<<"UNDER MAIN TENIS"<<endl;
+    if(first(L) == NULL){
+        cout<<"tidak ada lagu"<<endl;
+    }else{
+        address P = findElmByID(L, x);
+        if(P != NULL){
+            address Prec = prev(P);
+            deleteAfter(L, Prec, P);
+            deallocate(P);
+        }else{
+            cout<<"ID not found"<<endl;
+        }
+    }
 
     //----------------------------------------