Step 1: Possible groups of order 6.
Up to isomorphism, there are two groups of order 6: the cyclic group \( \mathbb{Z}_6 \), which is cyclic, and the symmetric group \( S_3 \), which is non-cyclic. Hence, \( G \) need not be cyclic.
Step 2: Possible orders of subgroup \( H \).
By Lagrange's Theorem, the order of \( H \) must divide 6. Since \( 1 < |H| < 6 \), we have \( |H| = 2 \) or \( |H| = 3 \).
Step 3: Cyclicity of \( H \).
Any group of prime order is cyclic. Therefore, every subgroup of order 2 or 3 is cyclic.
Step 4: Conclusion.
Thus, \( G \) may not be cyclic, but \( H \) is always cyclic.

Consider the following code:
int a;
int arr[] = {30, 50, 10};
int *ptr = arr[10] + 1;
a = *ptr;
(*ptr)++;
ptr = ptr + 1;
printf("%d", a + arr[1] + *ptr);
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative

Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.