diff --git a/ASD_Task_4.depend b/ASD_Task_4.depend
index a544662..94259a5 100644
--- a/ASD_Task_4.depend
+++ b/ASD_Task_4.depend
@@ -19,3 +19,23 @@
 	"player.h"
 	<ctime>
 
+1583584086 source:d:\asd task\asd_task_4\list.cpp
+	"list.h"
+
+1583584086 d:\asd task\asd_task_4\list.h
+	<string>
+	<windows.h>
+	<iostream>
+
+1583584086 source:d:\asd task\asd_task_4\player.cpp
+	"player.h"
+	<ctime>
+
+1583582893 d:\asd task\asd_task_4\player.h
+	"list.h"
+
+1583586421 source:d:\asd task\asd_task_4\main.cpp
+	"player.h"
+	"list.h"
+	<conio.h>
+
diff --git a/asset/airpump2.wav b/asset/airpump2.wav
deleted file mode 100644
index 5d371e7..0000000
Binary files a/asset/airpump2.wav and /dev/null differ
diff --git a/asset/bruh.wav b/asset/bruh.wav
new file mode 100644
index 0000000..4cb45e7
Binary files /dev/null and b/asset/bruh.wav differ
diff --git a/asset/clapping.wav b/asset/clapping.wav
deleted file mode 100644
index 84c2031..0000000
Binary files a/asset/clapping.wav and /dev/null differ
diff --git a/asset/game_start.WAV b/asset/game_start.WAV
deleted file mode 100644
index 4e196ab..0000000
Binary files a/asset/game_start.WAV and /dev/null differ
diff --git a/asset/mission_failed.wav b/asset/mission_failed.wav
new file mode 100644
index 0000000..09f9c4d
Binary files /dev/null and b/asset/mission_failed.wav differ
diff --git a/asset/oof.wav b/asset/oof.wav
new file mode 100644
index 0000000..aa60655
Binary files /dev/null and b/asset/oof.wav differ
diff --git a/asset/sans.wav b/asset/sans.wav
new file mode 100644
index 0000000..63eab71
Binary files /dev/null and b/asset/sans.wav differ
diff --git a/bin/Debug/ASD_Task_4.exe b/bin/Debug/ASD_Task_4.exe
new file mode 100644
index 0000000..60830e0
Binary files /dev/null and b/bin/Debug/ASD_Task_4.exe differ
diff --git a/list.cpp b/list.cpp
index 847a957..e028416 100644
--- a/list.cpp
+++ b/list.cpp
@@ -1,123 +1,188 @@
 #include "list.h"
 
-void createList(List &L) {
+void createList(List &L)
+{
     /**
     * FS : first(L) diset Nil
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    first(L) = NULL;
 }
-
-address allocate(infotype x) {
+address allocate(infotype x)
+{
     /**
     * FS : mengembalikan elemen list baru dengan info = x,
     *      next dan prev elemen = Nil
     */
-
     address P = NULL;
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    P = new elmlist;
+    info(P) = x;
+    next(P) = NULL;
+    prev(P) = NULL;
     return P;
 }
-
-void deallocate(address &P) {
+void deallocate(address &P)
+{
     /**
     * FS : menghapus elemen yang ditunjuk oleh P (delete)
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    delete P;
 }
-
-void insertFirst(List &L, address P) {
+void insertFirst(List &L, address P)
+{
     /**
     * IS : List L mungkin kosong
     * FS : elemen yang ditunjuk P menjadi elemen pertama pada List L
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    if (first(L) != NULL)
+    {
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        next(prev(first(L))) = P;
+        prev(first(L)) = P;
+        first(L) = P;
+    }
+    else
+    {
+        first(L) = P;
+        next(P) = first(L);
+        prev(P) = P;
+    }
 }
-
-void insertLast(List &L, address P) {
+void insertLast(List &L, address P)
+{
     /**
     * IS : List L mungkin kosong
     * FS : elemen yang ditunjuk P menjadi elemen terakhir pada List L
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    if (first(L)==NULL)
+    {
+        insertFirst(L,P);
+    }
+    else
+    {
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        next(prev(first(L))) = P;
+        prev(first(L)) = P;
+    }
 }
-
-address findElmByID(List L, infotype x) {
+address findElmByID(List L, infotype x)
+{
     /**
     * IS : List L mungkin kosong
     * FS : mengembalikan elemen dengan info.ID = x.ID,
            mengembalikan Nil jika tidak ditemukan
     */
-
     address P = NULL;
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
-    return P;
+    P = first(L);
+    do
+    {
+        P = next(P);
+    }
+    while( P != first(L)&& info(P).ID != x.ID);
+    if (info(P).ID == x.ID)
+    {
+        return P;
+    }
+    return NULL;
 }
-
-address findElmByName(List L, infotype x) {
+address findElmByName(List L, infotype x)
+{
     /**
     * IS : List L mungkin kosong
     * FS : mengembalikan elemen dengan info.name = x.name,
            mengembalikan Nil jika tidak ditemukan
     */
-
     address P = NULL;
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
-    return P;
+    P = first(L);
+    do
+    {
+        P = next(P);
+    }
+    while( P != first(L) && info(P).name != x.name);
+    if (info(P).name == x.name)
+    {
+        return P;
+    }
+    return NULL;
 }
-
-void deleteFirst(List &L, address &P) {
+void deleteFirst(List &L, address &P)
+{
     /**
     * IS : List L mungkin kosong
     * FS : elemen pertama di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
-    //------------- YOUR CODE HERE -------------
 
-    //----------------------------------------
+    if (first(L)==NULL)
+    {
+        cout<<"List Kosong"<<endl;
+    }
+    P = first(L);
+    if (next(first(L))!= P)
+    {
+        first(L) = next(P);
+        next(prev(P)) = first(L);
+        prev(first(L)) = prev(P);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
+    else
+    {
+        next(P) = NULL;
+        prev(P) = NULL;
+        first(L) = NULL;
+    }
 }
-
-void deleteLast(List &L, address &P) {
+void deleteLast(List &L, address &P)
+{
     /**
     * IS : List L mungkin kosong
     * FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    P = prev(first(L));
+    next(prev(P))= first(L);
+    prev(first(L)) = prev(prev(P));
+    next(P) = NULL;
+    prev(P) = NULL;
 }
-
-void insertAfter(List &L, address &Prec, address P) {
+void insertAfter(List &L, address &Prec, address P)
+{
     /**
     * IS : Prec dan P tidak NULL
     * FS : elemen yang ditunjuk P menjadi elemen di belakang elemen yang
     *      ditunjuk pointer Prec
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
-
+    if (first(L) == NULL)
+    {
+        insertFirst(L,P);
+    }
+    else
+    {
+        next(P) = next(Prec);
+        prev(P) = Prec;
+        prev(next(Prec)) = P;
+        next(Prec) = P;
+    }
 }
-void deleteAfter(List &L, address &Prec, address &P) {
+void deleteAfter(List &L, address &Prec, address &P)
+{
     /**
     * IS : Prec tidak NULL
     * FS : elemen yang berada di belakang elemen Prec dilepas
     *      dan disimpan/ditunjuk oleh P
     */
-    //------------- YOUR CODE HERE -------------
-
-    //----------------------------------------
+    P = next(Prec);
+    if (next(Prec) != first(L))
+    {
+        next(Prec) = next(P);
+        prev(next(P)) = Prec;
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
+    else
+    {
+        next(P) = NULL;
+        prev(P) = NULL;
+        P = NULL;
+    }
 }
-
diff --git a/list.h b/list.h
index 4468d0f..cca5f52 100644
--- a/list.h
+++ b/list.h
@@ -28,17 +28,13 @@ 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..2f8c9e6 100644
--- a/main.cpp
+++ b/main.cpp
@@ -21,19 +21,25 @@ int main() {
     //-----------------------------------------
     x.ID = index_ID++;
     x.location = "asset";
-    x.name = "do.wav";
+    x.name = "bruh.wav";
     P = allocate(x);
-    insertFirst(L,P);
+    insertLast(L,P);
+
+    x.ID = index_ID++;
+    x.location = "asset";
+    x.name = "sans.wav";
+    P = allocate(x);
+    insertLast(L,P);
 
     x.ID = index_ID++;
     x.location = "asset";
-    x.name = "re.wav";
+    x.name = "oof.wav";
     P = allocate(x);
     insertLast(L,P);
 
     x.ID = index_ID++;
     x.location = "asset";
-    x.name = "mi.wav";
+    x.name = "mission_failed.wav";
     P = allocate(x);
     insertLast(L,P);
 
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
new file mode 100644
index 0000000..6bdf506
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..6e2060b
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..8a48fdd
Binary files /dev/null and b/obj/Debug/player.o differ
diff --git a/player.cpp b/player.cpp
index 31ef288..e98e76b 100644
--- a/player.cpp
+++ b/player.cpp
@@ -1,77 +1,111 @@
 #include "player.h"
 #include <ctime>
 
-int randomInt(int  max_int) {
+int randomInt(int  max_int)
+{
     /** YOU DON'T NEED TO MODIFY THIS */
     srand(time(NULL));
     return (rand() % max_int) + 1;
 }
-
-void printInfo(List L) {
+void printInfo(List L)
+{
     /**
     * PR : menampilkan informasi ID, nama, dan lokasi file
     * YOU DON'T NEED TO MODIFY THIS
     */
-
     address Q = first(L);
-    do {
+    do
+    {
         cout<<"name    : "<<info(Q).name<<endl
             <<"ID      : "<<info(Q).ID<<endl
             <<"location: "<<info(Q).location<<endl;
         Q = next(Q);
-    } while(Q!=first(L));
+    }
+    while(Q!=first(L));
     cout<<"==============================================="<<endl;
 }
-
-
-void playMusic(address P) {
+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
 }
-
-
-void shuffleList(List &L) {
+void shuffleList(List &L)
+{
     /**
     * PR : mengacak isi (elemen) dari list L
     * FS : isi (elemen) dari list teracak
     */
-    //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
-
-    //----------------------------------------
+    address P = first(L);
+    int panjang = 0;
+    do
+    {
+        P = next(P);
+        panjang++;
+    }
+    while (P != first(L));
+    while (panjang > 0)
+    {
+        P = first(L);
+        int i = randomInt(panjang);
+        while (i != 0)
+        {
+            P = next(P);
+            i--;
+        }
+        address Q = P;
+        deleteAfter(L,prev(P),Q);
+        insertFirst(L,Q);
+        panjang--;
+    }
+    cout<<"Shuffle Done"<<endl;
 }
-
-void playRepeat(List &L, int n) {
+void playRepeat(List &L, int n)
+{
     /**
     * PR : memainkan seluruh lagu di dalam list
     *      dari lagu pertama hingga terakhir sebanyak n kali
     */
-    //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
-
-    //----------------------------------------
+    address P = first(L);
+    for (int i = 0; i < n; i++)
+    {
+        do
+        {
+            playMusic(P);
+            P = next(P);
+        }
+        while (P != first(L));
+    }
 }
-
-void deleteMusicByID(List &L, infotype x) {
+void deleteMusicByID(List &L, infotype x)
+{
     /**
     * IS : list L mungkin kosong
     * PR : menerima input user untuk ID lagu yang ingin dihapus
     *      jika ID lagu ditemukan, hapus (deallocate) lagu dari list
     * FS : elemen dengan ID yang dicari dideallocate
     */
-    //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
-
-    //----------------------------------------
-
+    address P,Q;
+    Q = findElmByID(L,x);
+    if(Q == NULL)
+    {
+        cout<<"music not found"<<endl;
+    }
+    else if (Q == first(L))
+    {
+        deleteFirst(L,P);
+        deallocate(P);
+        cout<<"delete music success"<<endl;
+    }
+    else if (Q != NULL)
+    {
+        deleteAfter(L, prev(Q), P);
+        deallocate(P);
+        cout<<"delete music success"<<endl;
+    }
 }