Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: Enter 15 integers: 1 2 3 4 5 6 7 8 9 0 10 11 12 13 14 1 2 3 4 5 6 7 8 9 0 10 11 12 13 14 The position of the first occurrence of the smallest element in list is: 9 The smallest element in list is: 0 You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42

In C++, When an array is passed to a function as a pointer, the function doesn't know the size of the array. List 3 ways to handle this problem.

in the C++ version please suppose to have a score corresponding with probabilities at the end and do not use the count[] function. Please explain the detail when coding. DO NOT USE ARRAY. The game of Pig The game of Pig is a dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - if the player rolls 1: the player scores nothing and it becomes the opponents turn. 2 - 6: the number is added to the player's turn total and the player's turn continues. hold - The turn total is added to the player's score and it becomes the opponent's turn. This game is a game of probability. Players can use their knowledge of probabilities to make an educated game decision.   Assignment specifications Hold-at-20 means that the player will choose to roll…

In C++ i need the fill in the functions that will complete this code for the program to work.

in C++

Problem 2: Write a function called digitMatch. The function has three integer parameters first , second and third that are positive and have the same number of digits. It returns the number of positions where their digits match. For example, if the function was applied to 17345, 97813 and 17313 it would return 1 because only the 2nd digits match. If parameters have illegal values your function can operate however you choose. For example, a program that uses the function follows. int main() { cout <« digitMatch(168, 567, 767) « endl; // prints 1 cout <« digitMatch(143, 243, 343) « endl; // prints 2 return 0; }

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;}