Write the function no$\_$duplicates$($L$)$ that receives a list of integers $$ and returns a list containing the result of removing duplicate elements in $.$ The elements must appear in the same order they appear in $$ ; if an element appears multiple times in $,$ only its first appearance should be included in the returned list. For example, no$\_$duplicates$([3,6,2,3,1,2,7,3])$ should return $[3,6,2,1,7].$ Use a set to enable the function to run in $()$ time.