Create a function called $$even$.$ The input of the function is a natural number n$.$ Thefunction returns a list of all even integers between $0$ and n$\mathrm{.}2.$ Create a function called $$firstLastEqual$.$ The inputs are two lists A and B$.$ Thefunction returns the Boolean value $$True$$ if the first entries of A and B are equalor the last entries of A and B are equal $($or both$).$ Otherwise, the function returns$$False$\mathrm{.}3.$ Create a function called $$findPudding$.$ The input is a dictionary D$.$ If at least one ofthe values in D is the string $$pudding$,$ then the output is a list where the first entry isthe boolean value $$True$$ and the second entry is a key in D whose value is $$pudding$.$Otherwise, the output is $$False$.$ If you want an extra challenge $($optional$),$ make yourlist include all keys whose value is $$pudding$.$