Consider the following statements:
S1: LRU page replacement algorithm suffers from the belady's anomaly
S2: Shortest remaining time first scheduling may cause starvations
S3: Stack is shared by all threads in a process
- $\mathrm{S} 1 \mathrm{~S} 2$ and $\mathrm{S} 3$ are true
- $\mathrm{S} 1, \mathrm{~S} 3$ false and $\mathrm{S} 2$ is true
- $\mathrm{S} 1, \mathrm{~S} 2$ are false and $\mathrm{S} 3$ is true
- $\text{S1, S2}$ and $\mathrm{S} 3$ are false
