d. Write a function Encode as follows: • // Return M^e mod PQ • int Encode (int M, int e, int PQ); e. Write a function Decode as follows: • //Return C^d mod PQ • int Decode (int C, int d, int PQ); f. Verify that RSA algorithm works, i.e., • int M; • /* M is an integer that is smaller than PQ */ • cout <<"Enter an integer that is smaller than"<< PQ; • cin <

1. Below, enter code to complete implementation of a recursive function sum allintegers(), which takes an input n and adds all integers preceding it, up to n: add all integers(n):

Initialize a vector v1 with the following values: 0 23 -7 8 -22 3 14 Write a MATLAB program from the values in v1. The vector v2 should contain the values in v1 transformed as follows: that uses a for-loop and if-statements to make a new vector v2 multiply each positive even element in v1 by 3, multiply each positive odd element of v1 by -2, and change the sign of the negative elements in v1. Then, output the new vector to the command window as follows: The new vector is: -46 7 24 22 -6 42 Also, compute and output the mean of the values in the new vector: The mean of the new vector is: xxxx Above, xxxx is the mean of the values in the new vector with 1 decimal place.

a) Implement a function start( ) that takes as input a positive number a, rounds its logarithm base 4 to the nearest integer n, and returns the value of 1.0 x 2^n.

Write a void function to find the average score on each test and store in an array testAvgs. Write a void function to print the average score for each student, i.e. print the contents of the array studentAvgs. The output will be well formatted and accompanied with appropriate messages. Write a void function to print the average score on each test, i.e. print the contents of the array testAvgs. The output will be well formatted and accompanied with appropriate messages. Add the following declaration for the array studentsPassing in the function main. bool studentsPassing[MAX_STUDENTS]; Write a function that initializes all components of the array studentsPassing to false. The array studentsPassing is a parameter. void Initialize(bool studentsPassing[],int numberOfStudents) Write a function that has studentsPassing , studentAvgs, and numberOfStudents as parameters.  Set the components of passing to true whenever the corresponding value in studentAvgs is greater than or equal to 50.0…

Write a function lis_rec(arr) that outputs the length of the longest increasing sequence and the actual longest increasing sequence. This function should use divide and conquer strategy to the solve the problem, by using an auxiliary function that is recursive. For example, one possibility is to define a recursive function, lis_rec(arr, i, prev), that takes the array arr, an index i, and the previous element index prev of LIS (which is part of the array arr before index i), and returns the length of the LIS that can be obtained by considering the subarray arr[i:]. Write a dynamic programming version ofthe function, lis_dp(arr), that outputs the length of the longest increasing sequence and the actual longest increasing sequence by using a table to store the results of subproblems in a bottom-up manner. Test the performance of the two functions on arrays of length n = 100, 500, 1000, 5000, 10000. Compare the running times and memory usage of the two functions.

Write a function using Java   Function Name: winInRowParameters: board: 2D integer array, row: integer, piece: integerReturn: booleanAssume board is valid 2D int array, row is valid index in the board, piece is X==1/O==2Look at indicated row at given index in board. If that row has at least 3 consecutive entries withgiven type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.

In python find_substring("It was the best of times, it was the worst of times", "i") [20, 26, 47] >>> find_substring('Episode III: Revenge of the Sith', "e ") [6, 19, 26] >>> find_substring("bobbobob", "bob") [0, 3, 5]