Implement the Greedy Algorithm discussed for the problem below, in C++. Using C++, implement the given problem below. (Greedy Algorithm) Given an array of size n that has the following specifications: 1.Each element in the array contains either a policeman or a thief. 2.Each policeman can catch only one thief. 3.A policeman cannot catch a thief who is more than K units away from the policeman. We need to find the maximum number of thieves that can be caught.  Examples: Input arr[] = {'P', 'T', 'T', 'P', 'T'}, k = 1. Output: 2. Here maximum 2 thieves can be caught, first policeman catches first thief and second police- man can catch either second or third thief. Input = arr[] = {'T', 'T', 'P', 'P', 'T', 'P'}, k = 2. Output: 3. Input arr[] = {'P', 'T', 'P', 'T', 'T', 'P'}, k = 3. Output: 3.

Solve this algorithm problem using Pythkn

Using C++, code the following problem: In this problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. The goal is to maximize the total profit, which is the sum of the profits of each object we put into the knapsack. Example: Input: C = 3 W: 1 2 3 P: 100 5 50 Selected Items: 1 2 Explanation: Possible selections that can be put in the knapsack are: 1 with profit 100 2 with profit 5 3 with profit 50 1 and 2 with profit 105 Note that in this problem, there is no need that the some of weights be exactly C. Hence, in this example, 1 is a valid solution but since the profit is lower than the maximum, is not the final answer. Input Format First line is C. Second line is the number of objects, N. The next N lines, each line contains two numbers: the first number is the weight of an…

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):

All of the information is below(JAVA), I need this in an hour if possible, thank you!!

C++ only Example Input14 31 1 1 24 14 23 2Example Output432

Write a fraction calculator program that adds, subtracts, multiplies, and di-vides fractions. Your program should check for the division by 0, have and use the following functions:(a) subtract - finds the reduced difference of a pair of given fractions, by makingthe second fraction negative then using the add function.(b) multiply - finds the reduced product of a pair of given fractions.(c) divide - finds the reduced quotient of a pair of given fractions by inverting the second fraction then using the multiply function

Write a fraction calculator program that adds, subtracts, multiplies, and di-vides fractions. Your program should check for the division by 0, have and use the following functions (a) reduce - reduces a given fraction.(b) flip - reduces a given fraction and flips the sign if the denominator is negative.(c) add - finds the reduced sum of a pair of given fractions.

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.

10 - JAVA CODE ONLY