Q1) Write a prolog program to find the count number of even numbers of integer list.

Linked List Write a DETAILED algorithm length to count the number of nodes in a singly linked list p, where p points to the first node in the list. The last node has link field NULL. Assume that each node has two fields: data and link. Account for the range of all possible linked list lengths. Needs to be in detailed and code in C PROGRAM would be helpful!

use java

write a recursive function that checks see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False.   Here is python code that needs to be fixed         # Returns the first character of the string str def firstCharacter(str):     return str[:1] # Returns the last character of a string str def lastCharacter(str):     return str[-1:] # Returns the string that results from removing the first #  and last characters from str def middleCharacters(str):     return str[1:-1] def isPalindrome(str):     # base case #1     # base case #2     # recursive case     pass def isPalindrome(string):     reversedString = string[::-1]      if reversedString == string:          return True     else:          return False inputString = input()  string = inputString.replace(" ", "") if isPalindrome(string):     print(inputString,"is a palindrome")  else:      print(inputString,"is not a palindrome")       if __name__ ==…