diff --git a/list.cpp b/list.cpp
index 847a957..a43b79d 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,12 @@ 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;
+    next(P) = NULL;
+    prev(P) = NULL;
     //----------------------------------------
     return P;
 }
@@ -27,7 +32,7 @@ void deallocate(address &P) {
     * FS : menghapus elemen yang ditunjuk oleh P (delete)
     */
     //------------- YOUR CODE HERE -------------
-
+    delete(P);
     //----------------------------------------
 }
 
@@ -37,7 +42,17 @@ void insertFirst(List &L, address P) {
     * FS : elemen yang ditunjuk P menjadi elemen pertama pada List L
     */
     //------------- YOUR CODE HERE -------------
-
+     if (L.first == NULL) {
+        next(P) = P;
+        prev(P) = P;
+        first(L) = P;
+    } else {
+        next(P) = first(L);
+        prev(P) = prev(first(L));
+        first(L) -> prev -> next = P;
+        first(L) -> prev = P;
+        first(L) = P;
+    }
     //----------------------------------------
 }
 
@@ -47,7 +62,14 @@ void insertLast(List &L, address P) {
     * 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) = L.first -> prev;
+        first(L) -> prev -> next = P;
+        first(L) -> prev = P;
+    }
     //----------------------------------------
 }
 
@@ -60,7 +82,13 @@ address findElmByID(List L, infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+    P = first(L);
+    do {
+        P = next(P);
+    } while (P != first(L) && P -> info.ID != x.ID);
+    if (P == first(L) && P -> info.ID != x.ID) {
+        return NULL;
+    }
     //----------------------------------------
     return P;
 }
@@ -74,7 +102,13 @@ address findElmByName(List L, infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+        P = first(L);
+    do {
+        P = next(P);
+    } while (P != first(L) && P -> info.name != x.name);
+    if (P == first(L) && P -> info.name != x.name) {
+        return NULL;
+    }
     //----------------------------------------
     return P;
 }
@@ -85,7 +119,19 @@ void deleteFirst(List &L, address &P) {
     * FS : elemen pertama di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if (L.first == NULL) {
+        P = first(L));
+        next(P) = NULL;
+        prev(P) = NULL;
+        first(L) = NULL;
+    } else {
+        P = first(L);
+        first(L) = next(P);
+        first(L) -> prev = P -> prev;
+        prev(P) -> next = first(L);
+        next(P) = NULL;
+        prev(P) = NULL;
+    }
     //----------------------------------------
 }
 
@@ -95,7 +141,15 @@ void deleteLast(List &L, address &P) {
     * FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if (L.first == NULL) {
+        deleteFirst(L, P);
+    } else {
+        P = L.first -> prev;
+        P -> prev -> next = L.first;
+        L.first -> prev = P -> prev;
+        P -> next = NULL;
+        P -> prev = NULL;
+    }
     //----------------------------------------
 }
 
@@ -106,7 +160,14 @@ void insertAfter(List &L, address &Prec, address P) {
     *      ditunjuk pointer Prec
     */
     //------------- YOUR CODE HERE -------------
-
+    if (L.first == NULL) {
+        insertFirst(L, P);
+    } else {
+        P -> next = Prec -> next;
+        P -> prev = Prec;
+        Prec -> next -> prev = P;
+        Prec -> next = P;
+    }
     //----------------------------------------
 
 }
@@ -117,7 +178,15 @@ void deleteAfter(List &L, address &Prec, address &P) {
     *      dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if (Prec -> next == L.first) {
+        deleteFirst(L, P);
+    } else {
+        P = Prec -> next;
+        P -> next -> prev = Prec;
+        Prec -> next = P -> next;
+        P -> next = NULL;
+        P -> prev = NULL;
+    }
     //----------------------------------------
 }
 
diff --git a/list.h b/list.h
index 4468d0f..27f1843 100644
--- a/list.h
+++ b/list.h
@@ -29,14 +29,16 @@ 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..6dbaf0c 100644
--- a/main.cpp
+++ b/main.cpp
@@ -27,7 +27,7 @@ int main() {
 
     x.ID = index_ID++;
     x.location = "asset";
-    x.name = "re.wav";
+    x.name = "do'.wav";
     P = allocate(x);
     insertLast(L,P);
 
@@ -123,6 +123,8 @@ void runMenu(int menu) {
         // insert last music
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
+        P = inputMusic();
+        insertLast(L, P);
         //input music
         //insertLast()
 
@@ -143,7 +145,8 @@ void runMenu(int menu) {
         // play last music
         //------------- YOUR CODE HERE -------------
         cout<<"UNDER MAIN TENIS"<<endl;
-
+        P = L.first -> prev;
+        playMusic(P);
         //----------------------------------------
         break;
     case 6:
@@ -162,7 +165,14 @@ void runMenu(int menu) {
         // 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();
         break;
diff --git a/player.cpp b/player.cpp
index 31ef288..6ee2b04 100644
--- a/player.cpp
+++ b/player.cpp
@@ -43,7 +43,24 @@ void shuffleList(List &L) {
     * FS : isi (elemen) dari list teracak
     */
     //------------- YOUR CODE HERE -------------
-
+    address P = first(L);
+    int jumlah = 0;
+    do {
+        P = next(P);
+        jumlah++;
+    } while (P != first(L));
+    while (jumlah > 0) {
+        P = first(L);
+        int k = randomInt(jumlah);
+        while (k != 0) {
+            P = next(P);
+            k--;
+        }
+        address Q = P;
+        deleteAfter(L, Prev(P), Q);
+        insertFirst(L, Q);
+        jumlah--;
+    }
         cout<<"UNDER MAIN TENIS"<<endl;
 
     //----------------------------------------
@@ -55,7 +72,13 @@ void playRepeat(List &L, int n) {
     *      dari lagu pertama hingga terakhir sebanyak n kali
     */
     //------------- YOUR CODE HERE -------------
-
+    address P = first(L);
+    for (int i = 0; i < n; i++) {
+        do {
+            playMusic(P);
+            P = next(P);
+        } while (P != first(L));
+    }
         cout<<"UNDER MAIN TENIS"<<endl;
 
     //----------------------------------------
@@ -69,7 +92,12 @@ void deleteMusicByID(List &L, infotype x) {
     * FS : elemen dengan ID yang dicari dideallocate
     */
     //------------- YOUR CODE HERE -------------
-
+     if (first(L) != NULL) {
+        if (findElmByID(L, x) != NULL) {
+            deleteAfter(L, findElmByID(L, x) -> prev, P);
+            deallocate(P);
+        }
+    }
         cout<<"UNDER MAIN TENIS"<<endl;
 
     //----------------------------------------
diff --git a/player.h b/player.h
index c91676a..5001ba8 100644
--- a/player.h
+++ b/player.h
@@ -3,10 +3,21 @@
 
 #include "list.h"
 
-/** YOU DON'T NEED TO MODIFY THESE **/
+    /** YOU DON'T NEED TO MODIFY THIS */
+
+
 
 int randomInt(int);
 // helper random for shuffle
+    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));
+    cout<<"==============================================="<<endl;
+}
 
 void printInfo(List);
 // output the songs in the list
@@ -16,15 +27,44 @@ void playMusic(address P);
 
 void shuffleList(List &);
 // shuffle the song list
-
+     address P = first(L);
+    int jumlah = 0;
+    do {
+        P = P -> next;
+        jumlah++;
+    } while (P != first(L));
+    while (jumlah > 0) {
+        P = first(L);
+        int k = randomInt(jumlah);
+        while (k != 0) {
+            P = next(P);
+            k--;
+        }
+        address Q = P;
+        deleteAfter(L,  prev(P), Q);
+        insertFirst(L, Q);
+        jumlah--;
+    }
 void playRepeat(List &, int n);
 // play the song list from the first song
 // and repeat the list n times
-
+    address P = first(L);
+    for (int i = 0; i < n; i++) {
+        do {
+            playMusic(P);
+            P =  next(P);
+        } while (P != first(L));
+    }
 void deleteMusicByID(List &, infotype);
 // user input song ID
 // remove the song from the list
-
+    address P;
+    if (first(L) != NULL) {
+        if (findElmByID(L, x) != NULL) {
+            deleteAfter(L, findElmByID(L, x) -> prev, P);
+            deallocate(P);
+        }
+    }
 
 
 #endif // PLAYER_H_INCLUDED