C++ Programming Language: Enhance the code given by outputting: The largest number of the sequence a0 ,a1 ,a2 , ..., ak. The position of the largest number Test your program for the following values of x: 75, 111, 678, 732, 873, 2048, and 65535. Example: "For example, for the input sequence: 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the program output should contain the following: The largest number of the sequence is 340 The position of the largest number is 4"   Code Given:   #include <iostream> #include <iomanip>   using namespace std; int main() { long x; int count; long a_n; cout << "Enter a nonnegative integer: "; cin >> x; cout << endl; count = 0; a_n = x; cout << a_n << ", "; while (a_n !=1) { if (a_n %2==0) a_n = a_n / 2; else a_n = 3 * a_n + 1; count++; cout << a_n <<", "; } cout << endl; cout << "The integer k such that a_k = 1 is " << count << endl; return0; }

FUNCTION AND ARRAY (C++ LANGUAGE) Create a sequence program that will input names to the arrayName array and then display the values in the array. Use a function for input values and display the values. (Create a program where you can input the full name and also create a program where you can input only the first name) -input 5 names only. - 2 functions - 2 codes upload code and output

C programming( I have asked this in C programming not C++. I have gotten this in C++ I want it in C programming)   The field of astronomy has been significantly advanced through the use of computer technology. Algorithms can automatically survey digital images of the night sky, looking for new patterns. For this problem, you should write such an analysis program which counts the number of stars visible in an bitmap image. An image consists of pixels, and each pixel is either black or white (represented by the characters # and -, respectively). All black pixels are considered to be part of the sky, and each white pixel is considered to be part of a star. White pixels that are adjacent vertically or horizontally are part of the same star. Input Each test case begins with a line containing a pair of integers 1≤m, n≤100. This is followed by mm lines, each of which contains exactly nn pixels. Input contains at least one and at most 50 test cases, and input ends at the end of file. Output…

#Basic Python, please help# Roses on a tree can be either red or white, represented with an appropriate data type that you will need to design. In panic mode, you must write a Python program that paints red all the roses on a rose tree. Test your program on 3 trees, each holding at least 7 roses.

In C++

2. You are given an array of integers below, in one operation you can choose any two numbers x, k and add the number x to the first k elements of the array. Write a program to find the minimum sum of Ix after you perform all operations such that all elements of the array become equal after the operations. Given array: [1,4,2,1] Expected Output: 6 Language: C++/Python

C Programming Language (Code With C Programming Language) Problem Title : Visible Trees There is a legend about a magical park with N × N trees. The trees are positioned in a square grid with N rows (numbered from 1 to N from north to south) and N columns (numbered from 1 to N from west to east). The height (in metres) of each tree is an integer between 1 and N × N, inclusive. Magically, the height of all trees is unique. Bunga is standing on the northmost point of the park and wants to count the number of visible trees for each Column. Similarly, Lestari is standing on the westmost point of the park and wants to count the number of visible trees for each Row. A tree X is visible if all other trees in front of the tree X are shorter than the tree X. For example, let N = 3 and the height (in metres) of the trees are as follows6 1 87 5 32 9 4 On the first column, Bunga can see two trees, as the tree on the third row is obstructed by the other trees. On the second column, Bunga can see…

Problem 6 (5 Points) Write a program that will create the following diagram *

c++ programme(look at images) An organization would like to store in an array up to 100 donations. A donation is a floating-point value. Write a program which reads donations and stores them into an array which is capable of only holding 100 floats. A value of -1 can be used to terminate the input. A sample run would be:Enter donation: 50.00Enter donation: 20.00Enter donation: 95.00Enter donation: -1As a result the array of donations would look like:Given this, using an additional array of 100 float pointers, sort the contents of the donations arrays without actually moving any data in the donations array.To do this, each element of the array of pointers should be pointing to the corresponding element of the donations array.Once this has been done, simply reorder the pointers to point to the elements of the donations array in ascending order. Your pointers array should look like this:Print out the collection of numbers sorted using the pointers array