The code segment below displays a pattern of asterisks. Select an expression to complete the code segment so that the resulting algorithm has O(n) running time.
for (int k = 0; ifor {
System.out.print()
}
System.out.println();
}
a. (int 1 -1; } b. (int j - n1 0; 1)
c. (int j - 1:1-10; ++)
d. (int 1-1 01.3./2)