Based off Java

Homework 2 Analyzing Runtimes of Algorithms Homework Objectives Be able to understand the part of the code Be able to analyze the efficiency of the given part of the code Introduction We have shown the Big-O Notation. Use Big-O notation to analyze the codes. Task #1 Big-O based Runtime Analysis 1. Give the Big-O runtime of the following code parts as much as tight. for (int i = 0; i i; j=j--) { sequence of statements for (int k= 0; ki;j--) { sequence of statements for (int i=0;ii;j-2) { sequence of statements for (int i=0; i<><>