diff --git a/ASD_Task_4.depend b/ASD_Task_4.depend
index a544662..5372f9e 100644
--- a/ASD_Task_4.depend
+++ b/ASD_Task_4.depend
@@ -19,3 +19,23 @@
 	"player.h"
 	<ctime>
 
+1583592682 source:c:\users\user\documents\github\asd_task_4\main.cpp
+	"player.h"
+	"list.h"
+	<conio.h>
+
+1583383921 c:\users\user\documents\github\asd_task_4\player.h
+	"list.h"
+
+1583591772 c:\users\user\documents\github\asd_task_4\list.h
+	<string>
+	<windows.h>
+	<iostream>
+
+1583591007 source:c:\users\user\documents\github\asd_task_4\player.cpp
+	"player.h"
+	<ctime>
+
+1583592973 source:c:\users\user\documents\github\asd_task_4\list.cpp
+	"list.h"
+
diff --git a/bin/Debug/ASD_Task_4.exe b/bin/Debug/ASD_Task_4.exe
new file mode 100644
index 0000000..13c00c4
Binary files /dev/null and b/bin/Debug/ASD_Task_4.exe differ
diff --git a/list.cpp b/list.cpp
index 847a957..1958e6b 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;
     //----------------------------------------
 }
 
@@ -15,8 +15,11 @@ address allocate(infotype x) {
     *      next dan prev elemen = Nil
     */
 
-    address P = NULL;
+    address P;
     //------------- YOUR CODE HERE -------------
+    P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
 
     //----------------------------------------
     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(P) = P;
+        prev(P) = P;
+    }else{
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        next(prev(first(L))) = P;
+        prev(first(L)) = P;
+        first(L) = P;
+    }
     //----------------------------------------
 }
 
@@ -47,7 +60,16 @@ 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(P) = P;
+        prev(P) = P;
+    }else{
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        next(prev(first(L))) = P;
+        prev(first(L)) = P;
+    }
     //----------------------------------------
 }
 
@@ -58,11 +80,16 @@ address findElmByID(List L, infotype x) {
            mengembalikan Nil jika tidak ditemukan
     */
 
-    address P = NULL;
+    address P = first(L);
     //------------- YOUR CODE HERE -------------
-
+    do{
+        P = next(P);
+    }while(P != first(L) && info(P).ID != x.ID);
+    if(info(P).ID == x.ID){
+        return P;
+    }
     //----------------------------------------
-    return P;
+    return NULL;
 }
 
 address findElmByName(List L, infotype x) {
@@ -72,11 +99,16 @@ address findElmByName(List L, infotype x) {
            mengembalikan Nil jika tidak ditemukan
     */
 
-    address P = NULL;
+    address P = first(L);
     //------------- YOUR CODE HERE -------------
-
+    do{
+        P = next(P);
+    }while(P != first(L) && info(P).name  != x.name);
+    if(info(P).name == x.name){
+        return P;
+    }
     //----------------------------------------
-    return P;
+    return NULL;
 }
 
 void deleteFirst(List &L, address &P) {
@@ -85,7 +117,14 @@ 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(next(P) == first(L)){
+        first(L) = NULL;
+    }else{
+        next(prev(first(L))) = next(P);
+        first(L) = next(P);
+        next(prev(first(L))) = first(L);
+    }
     //----------------------------------------
 }
 
@@ -95,7 +134,13 @@ void deleteLast(List &L, address &P) {
     * FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if(prev(first(L)) != NULL){
+        P = prev(first(L));
+        prev(first(L)) = prev(prev(first(L)));
+        next(prev(prev(first(L)))) = first(L);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -106,7 +151,10 @@ void insertAfter(List &L, address &Prec, address P) {
     *      ditunjuk pointer Prec
     */
     //------------- YOUR CODE HERE -------------
-
+    prev(next(Prec)) = P;
+    next(P) = next(Prec);
+    next(Prec) = P;
+    prev(P) = Prec;
     //----------------------------------------
 
 }
@@ -117,7 +165,18 @@ void deleteAfter(List &L, address &Prec, address &P) {
     *      dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    P = next(Prec);
+    if(next(next(Prec)) == Prec){
+        next(P) = NULL;
+        prev(P) = NULL;
+        next(Prec) = Prec;
+        prev(Prec) = Prec;
+    }else{
+        next(Prec) = next(P);
+        prev(next(P)) = Prec;
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index 4468d0f..08a59e0 100644
--- a/list.h
+++ b/list.h
@@ -29,15 +29,15 @@ typedef struct elmlist *address;
 
 struct elmlist {
     //-------------  YOUR CODE HERE  -----------
-
-
+    infotype info;
+    address next;
+    address prev;
     //----------------------------------------
 };
 
 struct List {
     //-------------  YOUR CODE HERE  -----------
-
-
+    address first;
     //----------------------------------------
 };
 
diff --git a/main.cpp b/main.cpp
index a66a5c1..07e4d18 100644
--- a/main.cpp
+++ b/main.cpp
@@ -123,8 +123,9 @@ void runMenu(int menu) {
         // insert last music
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
-        //input music
-        //insertLast()
+        P = inputMusic();
+        insertLast(L, P);
+        cout << "press enter";getche();
 
         //----------------------------------------
         cout<<"press enter";getche();
@@ -143,7 +144,9 @@ void runMenu(int menu) {
         // play last music
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
-
+        P = prev(first(L));
+        playMusic(P);
+        cout << "press enter";getche();
         //----------------------------------------
         break;
     case 6:
@@ -162,7 +165,13 @@ void runMenu(int menu) {
         // search music by ID
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
-
+        cin >> x.ID;
+        P = findElmByID(L, x);
+        if(P != NULL){
+            cout << "Musik Ditemukan" << endl;
+        }else{
+            cout << "Musik Tidak Ditemukan" << endl;
+        }
         //----------------------------------------
         cout<<"press enter";getche();
         break;
@@ -183,7 +192,11 @@ void runMenu(int menu) {
         // play previous music
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
-
+        if(P != NULL){
+            P = prev(P);
+            playMusic(P);
+        }
+        cout << "press enter";getche();
         //----------------------------------------
         break;
     case 11:
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
new file mode 100644
index 0000000..88902de
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..cc6710e
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..6248127
Binary files /dev/null and b/obj/Debug/player.o differ
diff --git a/player.cpp b/player.cpp
index 31ef288..c65aa07 100644
--- a/player.cpp
+++ b/player.cpp
@@ -14,12 +14,16 @@ void printInfo(List L) {
     */
 
     address Q = first(L);
-    do {
-        cout<<"name    : "<<info(Q).name<<endl
-            <<"ID      : "<<info(Q).ID<<endl
-            <<"location: "<<info(Q).location<<endl;
-        Q = next(Q);
-    } while(Q!=first(L));
+    if(first(L) != NULL){
+        do {
+            cout<<"name    : "<<info(Q).name<<endl
+                <<"ID      : "<<info(Q).ID<<endl
+                <<"location: "<<info(Q).location<<endl;
+            Q = next(Q);
+        } while(Q!=first(L));
+    }else{
+        cout << "List Kosong" << endl;
+    }
     cout<<"==============================================="<<endl;
 }
 
@@ -29,11 +33,14 @@ void playMusic(address P) {
     * PR : memainkan lagu yang ditunjuk oleh pointer P
     * YOU DON'T NEED TO MODIFY THIS
     */
-
-    string filename = info(P).location+"/"+info(P).name;
-    cout<<"playing "<<filename<<endl;
-    PlaySound(TEXT(filename.c_str()), NULL, SND_FILENAME);
-    _sleep(500); //delay 0.5 second
+    if(P != NULL){
+        string filename = info(P).location+"/"+info(P).name;
+        cout<<"playing "<<filename<<endl;
+        PlaySound(TEXT(filename.c_str()), NULL, SND_FILENAME);
+        _sleep(500); //delay 0.5 second
+    }else{
+        cout << "Musik Tidak Ada" << endl;
+    }
 }
 
 
@@ -44,8 +51,27 @@ void shuffleList(List &L) {
     */
     //------------- YOUR CODE HERE -------------
 
-        cout<<"UNDER MAIN TENIS"<<endl;
-
+    cout<<"UNDER MAIN TENIS"<<endl;
+    address P = first(L);
+    int i = 0;
+    do{
+        P = next(P);
+        i++;
+    }while(P != first(L));
+    address Q;
+    address R;
+    int j;
+    for(j=1; j<=1; j++){
+        int acak = randomInt(j);
+        int k = 1;
+        Q = first(L);
+        do{
+            Q = next(Q);
+            k++;
+        }while(Q != first(L) && k < acak);
+        deleteAfter(L, prev(Q), R);
+        insertFirst(L, R);
+    }
     //----------------------------------------
 }
 
@@ -56,8 +82,15 @@ void playRepeat(List &L, int n) {
     */
     //------------- YOUR CODE HERE -------------
 
-        cout<<"UNDER MAIN TENIS"<<endl;
-
+    cout<<"UNDER MAIN TENIS"<<endl;
+    int i;
+    for(i=0; i<n; i++){
+        address P = first(L);
+        do{
+            playMusic(P);
+            P = next(P);
+        }while(P != first(L));
+    }
     //----------------------------------------
 }
 
@@ -70,8 +103,20 @@ void deleteMusicByID(List &L, infotype x) {
     */
     //------------- YOUR CODE HERE -------------
 
-        cout<<"UNDER MAIN TENIS"<<endl;
-
+    cout<<"UNDER MAIN TENIS"<<endl;
+    address R;
+    address cari = findElmByID(L, x);
+    if(cari == NULL){
+        cout << "Music Tidak Ditemukan" << endl;
+    }else if(cari == first(L)){
+        deleteFirst(L, R);
+        deallocate(R);
+        cout << "Delete Berhasil" << endl;
+    }else if(cari != NULL){
+        deleteAfter(L, prev(cari), R);
+        deallocate(R);
+        cout << "Delete Berhasil" << endl;
+    }
     //----------------------------------------
 
 }