diff --git a/ASD_Task_4.depend b/ASD_Task_4.depend
index a544662..6add082 100644
--- a/ASD_Task_4.depend
+++ b/ASD_Task_4.depend
@@ -19,3 +19,23 @@
 	"player.h"
 	<ctime>
 
+1583588438 source:c:\users\kamil\documents\github\asd_task_4\main.cpp
+	"player.h"
+	"list.h"
+	<conio.h>
+
+1583583976 c:\users\kamil\documents\github\asd_task_4\player.h
+	"list.h"
+
+1583584680 c:\users\kamil\documents\github\asd_task_4\list.h
+	<string>
+	<windows.h>
+	<iostream>
+
+1583589676 source:c:\users\kamil\documents\github\asd_task_4\player.cpp
+	"player.h"
+	<ctime>
+
+1583588975 source:c:\users\kamil\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..e6a1937
Binary files /dev/null and b/bin/Debug/ASD_Task_4.exe differ
diff --git a/list.cpp b/list.cpp
index 847a957..02169d2 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)=x;
+    next(P)=NULL;
+    prev(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,18 @@ 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(prev(first(L)))=P;
+        prev(P)=prev(first(L));
+        prev(first(L))=P;
+        next(P)=first(L);
+        first(L)=P;
+
+    }
     //----------------------------------------
 }
 
@@ -47,7 +61,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(prev(first(L)))=P;
+        prev(P)=prev(first(L));
+        prev(first(L))=P;
+        next(P)=first(L);
+    }
     //----------------------------------------
 }
 
@@ -60,7 +83,13 @@ address findElmByID(List L, infotype x) {
 
     address P = NULL;
     //------------- YOUR CODE HERE -------------
-
+    P=first(L);
+    do{
+        if(info(P).ID==x.ID){
+            return NULL;
+        }
+        P=next(P);
+    }while(first(L)!=NULL && P!=first(L));
     //----------------------------------------
     return P;
 }
@@ -72,11 +101,16 @@ address findElmByName(List L, infotype x) {
            mengembalikan Nil jika tidak ditemukan
     */
 
-    address P = NULL;
+    address P = first(L);
     //------------- YOUR CODE HERE -------------
-
+    do{
+        if(info(P).name==x.name){
+            return P;
+        }
+        P=next(P);
+    }while(first(L)!=NULL && P!=first(L));
     //----------------------------------------
-    return P;
+    return NULL;
 }
 
 void deleteFirst(List &L, address &P) {
@@ -85,6 +119,13 @@ 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);
+    address Q=prev(first(L));
+    next(Q)=next(P);
+    prev(next(P))=Q;
+    P=next(P);
+    next(P)=NULL;
+    Q=NULL;
 
     //----------------------------------------
 }
@@ -95,7 +136,16 @@ void deleteLast(List &L, address &P) {
     * FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    if(first(L)=NULL){
+        deleteFirst(L,P);
+    }else{
+        P=prev(first(L));
+        address Q=prev(P);
+        next(Q)=first(L);
+        prev(first(L))=Q;
+        next(P)=NULL;
+        Q=NULL;
+    }
     //----------------------------------------
 }
 
@@ -106,7 +156,14 @@ void insertAfter(List &L, address &Prec, address P) {
     *      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;
+    }
     //----------------------------------------
 
 }
@@ -117,7 +174,11 @@ void deleteAfter(List &L, address &Prec, address &P) {
     *      dan disimpan/ditunjuk oleh P
     */
     //------------- YOUR CODE HERE -------------
-
+    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..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..0238cba 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;
@@ -161,8 +161,18 @@ 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;
+            cout<<endl;
+            cout<<"Name Music    : "<<info(P).name<<endl;
+            cout<<"ID Music      : "<<info(P).ID<<endl;
+            cout<<"Location Music: "<<info(P).location<<endl;
+        }else{
+            cout<<"Music Not Found"<<endl;
+        }
         //----------------------------------------
         cout<<"press enter";getche();
         break;
@@ -182,8 +192,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:
diff --git a/obj/Debug/list.o b/obj/Debug/list.o
new file mode 100644
index 0000000..4aa2bad
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..530b464
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..52138eb
Binary files /dev/null and b/obj/Debug/player.o differ
diff --git a/player.cpp b/player.cpp
index 31ef288..dff568c 100644
--- a/player.cpp
+++ b/player.cpp
@@ -43,9 +43,24 @@ void shuffleList(List &L) {
     * FS : isi (elemen) dari list teracak
     */
     //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
-
+    address P= first(L);
+    int i=0;
+    do{
+        P=next(P);
+        i++;
+    }while(P!=first(L));
+    address Q,R;
+    for(int j = 1; j <= i; j++){
+        int acak = randomInt(j);
+        int h = 1;
+        Q = first(L);
+        do{
+            h++;
+            Q = next(Q);
+        }while (Q != first(L) && h < acak);
+        deleteAfter(L,prev(Q),R);
+        insertFirst(L,R);
+    }
     //----------------------------------------
 }
 
@@ -55,8 +70,15 @@ void playRepeat(List &L, int n) {
     *      dari lagu pertama hingga terakhir sebanyak n kali
     */
     //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
+    address P = first(L);
+    int i=0;
+    while (i<n) {
+        do {
+            playMusic(P);
+            P=next(P);
+        } while(P != first(L));
+        i++;
+    }
 
     //----------------------------------------
 }
@@ -69,8 +91,15 @@ void deleteMusicByID(List &L, infotype x) {
     * FS : elemen dengan ID yang dicari dideallocate
     */
     //------------- YOUR CODE HERE -------------
-
-        cout<<"UNDER MAIN TENIS"<<endl;
+    address P;
+    if (first(L)!=NULL) {
+        if (findElmByID(L,x)!=NULL) {
+            deleteAfter(L,prev(findElmByID(L,x)),P);
+            deallocate(P);
+        }
+    }else{
+        cout<<"Music Not Found"<<endl;
+    }
 
     //----------------------------------------