Consider the declaration char street[10] = "abcdefghi"; Choose the correct remark(s) A. &street and street will have different values B. &street is meaningless C.  &street+1 and street+1 will have the same values D. None of the above

If num_cards is: 36, output 'Short deck'. • 48, output 'Pinochle'. 52, output 'Standard'. Otherwise, output 'Other deck size'. Click here for examples 1 num_cards 2 = int(input()) 3 if num_cards 36: 4 print ('Short deck') 5 elif num_cards 48: == 6 print ('Pinochle') 7 elif num_cards == 8 print ('Standard') 9 else: 52: 10 print ('Other deck size') 11

IN C# PLEASE Create class Cube. The class has attributes length and width and depth, each of which defaults to 1. It has read-only properties that calculate the Perimeter and the Area for a side of the cube, and another that calculates the cubed feet for the cube. (You will have to research how to do that calculation online) It has properties for length and width and depth. The set accessors should verify that length and width and depth are all floating-point numbers greater than 0.0 and less than 20.0. Write an app to test class Cube by creating 3 cubes of different sizes.

Assign numMatches with the number of elements in userValues that equal matchValue. userValues has NUM_VALS elements. Ex: If userValues is {2, 1, 2, 2} and matchValue is 2, then numMatches should be 3. Your code will be tested with the following values: matchValue: 2, userValues: {2, 1, 2, 2} (as in the example program above) matchValue: 0, userValues: {0, 0, 0, 0} matchValue: 10, userValues: {20, 50, 70, 100} (Notes) 324758.2040686.qx3zgy7 3 int main(void) { const int NUM VALS = 4; int userValues[NUM_VALS]; int i; int matchvalue; int numMatches = -99; // Assign numMatches with e before your for loop 4 1 test 5 passed 6 7 All tests 8 passed 9 scanf ("%d", &matchValue); 10 11 for (i = 0; i < NUM_VALS; ++i) { scanf("%d", &(userValues[i])); } 12 13 14 15 16 * Your solution goes here */ 17 18 printf("matchvalue: %d, numMatches: %d\n", matchValue, numMatches); 19 20 return 0;