Haskell. Write a Haskell function evenLength :: [a] -> Bool and the corresponding Prolog predicate evenLength, which returns (or resolves to) true when the single list argument passed to it has even length. Note: that these must be written from scratch, so no previously defined functions may be used, e.g., the Prelude length function (or the Prolog length predicate) may not be used — your solutions will be recursive. You may, of course define auxiliary helper functions (which also must be written from scratch), e.g., the appropriate oddLength :: [a] -> Bool might be useful in Haskell, and similarly, an oddLength predicate in Prolog. The idea is that in Haskell, e.g., evenLength [1,2,3,4] would return True, and evenLength "hey" would return False, while in Prolog, e.g., the query evenLength([1,2,3,4]). would resolve to true, and the query evenLength([a,b,c]). would resolve to false.

Program in C

Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function  (defun gcd (n m)"Returns the gcd of two numbers"  (let ((dividend n) (divisor m) (remainder 1))    (while (/= remainder 0)      (setq remainder (mod dividend divisor))      (setq dividend divisor)      (setq divisor remainder))    dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

Modify the function joinLine so that it right align the line to lengthlineLen by adding the appropriate number of space at the beginning ofthe line. (in Haskell)   code:  joinLine :: Line -> String joinLine [] = [] joinLine (w:ws) = w ++ " " ++ (joinLine ws)

Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

Haskell

I need the answer as soon as possible

I need this function to be defined using Haskell language.  Hailstone sequences are produced by repeatedly applying the following mapping to numbers: an even number n maps to n/2 and an odd number m maps to 3m+1.The function hailmap applies this transformation to a single integer.hailmap :: Integer -> Integerhailmap n = undefined Note: when the function is called using an integer the answer will be given based on the number being odd or even. -- ghci> hailmap 7-- 22-- ghci> hailmap 8-- 4 Note: Use div rather than / for division, to avoid the need for conversion between numeric types.-- ghci> 15 `div` 2-- 7

In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines -  Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime.  Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a…