Hello. I need help writing a Lisp function that uses 'numberp' to count the number of numbers that appear in a list. How can I do this? For example: -> (NUMBER-COUNT '(A 2.3 B 5 4.53 C F)) -> 3

can someone help me with this in C++ (not Java) create a program that reads in two matrices from two different text files. Should use a singly or double linked list to store the two matrices and perform the following operations on them: - Add, Subtract, Mulitply, Transpose, and Determinant Requirements: Use singly or doubly linked list date structures only: - No other library methods or existing collection framework. - No use of Array, ArrayList, List, or Vectors for storing. - No two-dimensional arrays. - Input files can only be read Exactly Once for all operations. For the determinant operation, you may augment your linked list node to retain row/column id and employ recursion to directly implement the standard method for computing determinant of a matrix. You are encouraged to design your own node representation (e.g., each node element has two pointers: one to its next right and another to its next bottom element that facilitate both horizontal and vertical traversals like one gets…

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

I need help being able to make a function that adds an item to the back of a doubly linked list to add an animal to the end of the list in C++ Here's what I got so far with the code #include <iostream> #include <string> using namespace std;   class node { public:     string data;// Data item     node* next; // Point to next node };   class linkedList { public:          // Variables? (Attributes)     node* headptr;          // Functions (methods)     linkedList()     {         headptr = nullptr;     }          // Add an item to front of list     void addFront(string x)     {         // Declare a pointer variable         node* p;                  // Create a new node, and store its address in p         p = new node;                  // Put x into data field of the new node         // Can also put p -> data = x, same thing.         (*p).data = x;                  // Set next pointer of node to previous front item         (*p).next = headptr;                  //Update the…