In Haskell and show type signature: Write a recursive function to count the numbers of a particular element in a list for example: cntElem 3 [1,2,3,3,4,5] = 2

In Haskell, use list comprehension to return all the numbers greater than 18 and divisible by 2 in the list [12, 24, 25, 28, 30, 33, 35] Write a Haskell function that takes a list and an integer n as parameters and returns the nth item in the list. EX. [1,2,3,4] 2 gives 3 and [1,2,3,4] 1 gives 2

C++ Write a program to test heapsort for array-based lists of an alphabet

In Haskell, use list comprehension to return all the numbers greater than 18 and divisible by 2 in the list [12, 24, 25, 28, 30, 33, 35]. SHOW OUTPUT AND SOURCE CODE

6. Code for implement insertion sort in java.

*Needs to be done in scheme interleave* Implement function interleave in scheme, which expects as arguments two lists x and y, and returns asingle list obtained by choosing elements alternately, first from x and then from y. When either x or yruns out, interleave takes the remaining elements from the other list, so that the elements of the resultare exactly the elements of the two argument lists taken together. (interleave '(1 2 3) '(a b c)) -> (1 a 2 b 3 c) (interleave '(1 2 3) '(a b c d e f)) -> (1 a 2 b 3 c d e f) (interleave '(1 2 3 4 5 6) '(a b c)) -> (1 a 2 b 3 c 4 5 6)

IN JAVA Write recursive code and iterative code for binary search.