Integrate with C$++$ this week

This week we are working with the concepts in Chapter $13.$

Assignment objective: After completing this assignment, you will have completed the following:

defined inline assembly code

Created a program that links $32-$bit assembly code to C$++.$

Windows Users: Create one program with all parts below. Be sure to copy your program into a $.$txt file for submission, with the output at the bottom. DON'T USE ANY CONDITIONAL CONTROL FLOW DIRECTIVES.

Start by creating a C$++$ Console Application in Visual Studio.

Write an inline assembly language portion $(\_\_$asm$)$ that uses $(1)$ the offset of an array and $(2)$ the array's size.

It will calculate the count of the longest increasing sequence of integer values.

For example, in the following array, the longest strictly increasing sequence begins at index $3$ and has a length of $4,\{14,17,26,42\}$ : from within the array: $-5,10,20,14,17,26,42,22,19,-5$

The C$++$ program must create the array, get the offset of the array, and the array size for the inline portion of $\_\_$asm code.

It will then print the value that the $\_\_$asm portion found.

Put your $.$cpp code, along with the output, in the $.$txt file for submission.

No $.$asm file should be used.

Mac Users: Create one program with all parts below. Be sure to copy your program into a $.$txt file for submission, with the output at the bottom. DON'T USE ANY CONDITIONAL CONTROL FLOW DIRECTIVES.

No C$++$ is needed. Do all of this in MIPS.

Calculate the count of the longest increasing sequence of integer values.

U CAN DO IT WITH MAC, OR WINDOWS BUT LET ME KNOW THANKS For example, in the following array, the longest strictly increasing sequence begins at index $3$ and has a length of $4,\{14,17,26,42\}$ : from within the array: $-5,10,20,14,17,26,42,22,19,-5$

Create the array and also a variable that has the length of the array.

Use the offset and the length to search through the array to find the longest sequence.

Put your code and output in a $.$txt file as usual.