Consider a system with an object x and nth reads. Determine if each of the following properties are equivalent to say in gx is deadlock-free, starvation-free, obstruction-free, lock-free, wait-free,...

Consider a system with an object x and nth reads. Determine if each of the following properties are equivalent to say in gx is deadlock-free, starvation-free, obstruction-free, lock-free, wait-free, or none of these. Briefly justify your answers

1. For every infinite history H of x, an infinite number of method calls complete.

2. For every finite history H of x, there is an infinite history H′=H·G.

3. For every infinite history H of x, every thread takes an infinite number of steps.

4. For every infinite history H of x, every thread that takes an infinite number of steps in H completes an infinite number of method calls.