Determine both the precise BigO and order of magnitude for each of the following sample code. You do not need to include the details for the parts inside the construction of the for-loop or conditional of any while-loops as part of your final answer, however, keep in mind it tells you how many times the inner parts will run. Your answers should be in the form of a Big-Oh polynomial (e.g., O(3n2+7n+6) ). For the code below N is a variable assumed to be some positive integer. Example int s=0; for(int i=0;i0;i){ if (i%2==0){ sum +=1; \} (Careful, the if statement should be part of the BigO and will be different from sum+=1. For sum+=1 consider when the if statement will true and how many times that will occur for a given positive integer N.) Code snippet \#4 int sumi =0; int sumik =0; for(int i=0;i<><>