wspstbxysj wspstbxysj 05-03-2024 Computers and Technology contestada Big O of void code1 (int n)( for (int k=1; k<=n; k++) int j = n; while j > 0)( call.Task: j= j-2; } } }