Programming language

Write Lisp functions to do the following. Test your functions on the 3 example cases given. 1. Convert a list of hexadecimal digits into the equivalent decimal number. You may find the function (expt n m), which computes n m to be useful. For example, ˆ (hextodec ’(a)) = 10 ˆ (hextodec ’(1 f)) = 31 ˆ (hextodec ’(5 a 6 b 7 c 8 d 9 e)) = 388350381470 2. An integer is said to be perfect if the sum of its factors, including 1, is equal to the number itself. Determine if an integer is perfect and if so, return it’s list of factors, otherwise return nil. You may find the function (mod n m) to be useful. For example, ˆ (perfect 6) = (1 2 3) ˆ (perfect 298) = nil ˆ (perfect 496) = (1 2 4 8 16 31 62 124 248) 3. Write a Lisp function (delete atom list) that returns the list with all occurrences, no matter how deep, of atom deleted. The returned list cannot contain anything in place of the deleted atoms. For example, ˆ (delete ’a ’(a b r a c a d a b r a)) = (b r c d b r) ˆ (delete ’b ’(no bs here)) = (no bs here) ˆ (delete ’nest ’(nest (second nest level) (third (nest) level) (((big nest))))) = ((second level) (third () level) (((big))))