Identify the Big-O (i.e. worst-case complexity) of each of t…

Identify the Big-O (i.e. worst-case complexity) of each of the following blocks of code (assume the “stuff” being done is some constant time). n is the input size:  [block1] for(int i=0; i0; i–) {   // do some stuff…} [block3] for(int i=0; i=0; j–) {    // do some other stuff…    }} [block4] for(int i=0; i0; i=i/2) {   // do some stuff…}