Assignment $3$ Directions $1.$ Create an algorithm to calculate a paycheck. The inputs will be a number of hours worked, a pay rate per hour, and a bonus. $2.$ The program will read in two or three integers, the first will be the number of hours worked, the second will be the pay rate. If there is a third number it will be a bonus added onto the pay after the multiplication. $3.$ Implement the program in a high level language like C$,$ C$++,$ or Java.$4.$ Implement the program in MIPSzy Assembly language. Use the high level code as comments to the right of the Assembly code as the textbook does. $5.$ If you write that MIPSzy program in a text editor, you can then paste it into the simulator box in $11\mathrm{.}1\mathrm{.}2$ of Chapter $11$ in the ZYBook. You can run the simulation there to test the code. $6.$ The input values should be entered in the input box before hitting run. Do not worry if the line wraps to the next line. $7.$ Input works by placing the value to be read in from the input box in memory location $8196$ and a $1$ in memory location $8192.$ If there is no more input a $0$ will be placed in memory location $8192.$ as a space delimited list. See the sample below. $8.$ Results should be written to memory location $8200$ which will cause them to be written to the output window. $9.$ Include a comment at the top of the program with your name and Panther id$.10.$ Export the file by clicking the More Options button and then Export on the right side. That will paste your program into a small box on the right. Copy and paste that into a text document. Call that document FirstnameLastnameA$3.$txt$.11.$ Submit FirstnameLastnameA$3.$txt$.1.$ Create an algorithm to calculate a paycheck. The inputs will be a number of hours worked, a pay rate per hour, and a bonus. $2.$ The program will read in two or three integers, the first will be the number of hours worked, the second will be the pay rate. If there is a third number it will be a bonus added onto the pay after the multiplication. $3.$ Implement the program in a high level language Java.$4.$ Implement the program in MIPSzy Assembly language. Use the high level code as comments to the right of the Assembly code as the textbook does. $5.$ If you write that MIPSzy program in a text editor, you can then paste it into the simulator box in $11\mathrm{.}1\mathrm{.}2$ of Chapter $11$ in the ZYBook. You can run the simulation there to test the code. $6.$ The input values should be entered in the input box before hitting run. Do not worry if the line wraps to the next line. $7.$ Input works by placing the value to be read in from the input box in memory location $8196$ and a $1$ in memory location $8192.$ If there is no more input a $0$ will be placed in memory location $8192.$ as a space delimited list. See the sample below. $8.$ Results should be written to memory location $8200$ which will cause them to be written to the output window. $9.$ Include a comment at the top of the program with your name and Panther id$.10.$ Export the file by clicking the More Options button and then Export on the right side. That will paste your program into a small box on the right. Copy and paste that into a text document. Call that document FirstnameLastnameA$3.$txt$.11.$ Submit FirstnameLastnameA$3.$txt$.$Here is a sample of the input and output:Input: $3218100$Output: $676$A sample program to show how to manage input and output is as follows. Type a single digit integer number in the Input box and run the program.addi $t$0,$ $zero, $8200$ # Output locBegLoop:$$ addi $t$6,$ $zero, $8192$ # Input ready?$$ lw $t$5,0($$t$6)$ beq $t$5,$ $zero, NoInput$$ addi $t$6,$ $zero, $8196$ # Input loc$$ lw $t$1,0($$t$6)$ addi $t$2,$ $zero, $1$ sw $t$2,0($$t$0)$ # Output to screen$$ mul $t$2,$ $t$2,$ $t$1$ # Times Input$$ sw $t$2,0($$t$0)$ # Output to screen$$ mul $t$2,$ $t$2,$ $t$1$ # Times Input$$ sw $t$2,0($$t$0)$ # Output to screen$$ mul $t$2,$ $t$2,$ $t$1$ # Times Input$$ sw $t$2,0($$t$0)$ # Output to screen$$ j BegLoopNoInput:

Instructions:

Submit the java project folder as a $.$zip file.

Write a java program to implement the following algorithms for Open Addressing techniques for Hash Table data structure. $($Use a simple array of integers to store integer key values only$).$For both algorithms, to compute the index j$,$ write the following methods:

getLinearProbIndex $($key$,$ i$)$

getQuadraticProbIndex $($key$,$ i$)$

getDoubleHash $($key$,$ i$)$

Linear Probing index is computed using following hash function:

$h(k,i)=(h_1(k)+i)modm$

$h_1(k)=$kmodm

Quadratic probing index is computed using following hash function:

COP$3530-$ Assignment $5$

Page $1$ of $2$

$h(k,i)=(h_1(k)+i^2)modm$

$h_1(k)=$kmodm

Double hashing index is computed using following hash function:

$h(k,i)=(h_1(k)+i{h}_2(k))modm$

$h_1(k)=$kmodm

$h_2(k)=1+(kmodm-1)$

Instructions:

Submit the java project folder as a $.$zip file.

Write a java program to implement the following algorithms for Open Addressing techniques for Hash Table d