Write a C function called ints2int_ptrs which takes two parameters: an array of integers (parameter name: arr) an integer n, indicating the length of the array and does the following: dynamically allocates an array of n integer pointers and populates this new array such that element i of this new array is a POINTER to arr[i] (for all i: 0..n-1) and returns this array of pointers

Python only** define the following function: 1.  This function must add a task to a checklist, setting its initial value to False. It will accept two parameters: the checklist object to add to, and the task name to add. In addition to adding the task, it must return the (now modified) checklist object that it was given. There is one issue, however: a task cannot be added to a checklist if the name requested is already being used by another task in that checklist. In that case, this function must print a specific message and must return None Define addTask with 2 parameters Use def to define addTask with 2 parameters   Use a return statement Within the definition of addTask with 2 parameters, use return _ in at least one place.   Do not use any kind of loop Within the definition of addTask with 2 parameters, do not use any kind of loop.

In C++ please and thank you!

Define a function named “getExamListInfo” that accepts an array of Exam objects and its size. It will return the following information to the caller: - The number of exams with perfect score - The number of exams with “Pass” status - The index of the Exam object in the array that has the largest score. For example, if you get the exam info for this array of Exam object Exam examList[] = { {"Midterm1 Exam", 90}, {"Midterm2 Exam", 80}, {"Final Exam", 50}, {"Extra Credit", 100}, {"Initial Test", 0}, {"Homework1", 69} } ; You will get Perfect Count: 1 Pass Count: 3 Index of the largest: 3  C++

Write a program that will sort a prmiitive array of data using the following guidelines - DO NOT USE VECTORS, COLLECTIONS, SETS or any other data structures from your programming language. The codes for both the money and currency should stay the same, the main focus should be on the main file code (Programming language Java) Create a helper function called 'RecurInsSort' such that: It is a standalone function not part of any class from the prior lab or any new class you feel like creating here, Takes in the same type of parameters as any standard Insertion Sort with recursion behavior, i.e. void RecurInsSort(Currency arr[], int size) Prints out how the array looks every time a recursive step returns back to its caller The objects in the array should be Money objects added or manipulated using Currency references/pointers. It is OK to print out the array partially when returning from a particular step as long as the process of sorting is clearly demonstrated in the output. In…

code in C

Using C++ Language Write a function call with arguments tensPlace, onesPlace, and userInt. Be sure to pass the first two arguments as pointers. Sample output for the given program: tensPlace = 4, onesPlace = 1  Code:  #include <stdio.h> void SplitIntoTensOnes(int* tensDigit, int* onesDigit, int DecVal){   *tensDigit = (DecVal / 10) % 10;   *onesDigit = DecVal % 10;} int main(void) {   int tensPlace;   int onesPlace;   int userInt;    scanf("%d", &userInt);    /* Your solution goes here  */    printf("tensPlace = %d, onesPlace = %d\n", tensPlace, onesPlace);    return 0;}