Please the solution is a code, it is accurate and correct and the solution should be with a screenshot and written text and outputs

I just want to solve this question, brother

Q1) Write c# or Java code to represent Transaction Processing , as following: a- Enter any Schedules and check if it is :- Recoverable, Non Recoverable, Cascadeless, Strict. Ex:- Input: (S)a r1(x); w1(x); r1(Y); w1(Y); r2(X); C1 ; w2(X); C2 Output: Recoverable. b- Check Schedules if it is Serial, Serializable, Non Serializable. Question 1 Show the dynamic and speculation execution for the following code Add F2,F3,F4 Loop: Lw F2,0(R1) Subi R1, R1,8 Div F9,F10,F11 Sw F9,5(R2) Bne R1,Loop 1 Fp & 1 Int operation can issue at the same cycle 3. execution stage 2 commit stage FP : 2 cycle Lw : 2 cycle ALU: 3 cycle Two iteration Q1) Write c# or Java code to represent Transaction Processing , as following: a- Enter any Schedules and check if it is :- Recoverable, Non Recoverable, Cascadeless, Strict. Ex:- Input: (S)a r1(x); w1(x); r1(Y); w1(Y); r2(X); C1 ; w2(X); C2 Output: Recoverable. b- Check Schedules if it is Serial, Serializable, Non Serializable. Question 1 Show the dynamic and speculation execution for the following code Add F2,F3,F4 Loop: Lw F2,0(R1) Subi R1, R1,8 Div F9,F10,F11 Sw F9,5(R2) Bne R1,Loop 1 Fp & 1 Int operation can issue at the same cycle 3. execution stage 2 commit stage FP : 2 cycle Lw : 2 cycle ALU: 3 cycle Two iteration