I need the time complexity of the following questions. For example: t(n) = (n^5)c1 + n(c2) - c3.

1) for (i = 1; i <= n; i++) for (j = 1 j <= n; j++){ x = 2 * y; z = x--; } 2) for (i = 1 i <= n; i++) j = n; while (j >= 1) { x++; j = j / 2; } 3) i = 1; while (i != n) i++; 4) for (i = 1 i <= n; i++) if (i == 1 || i == n || i == 3) for (j = 1 j <= n; j++)