Suppose we have a transaction T that is a function which runs forever, and at each hour checks whether there is a PC that has a speed of 3.5 or more and sells for under $1000. If it finds one, it prints the information and terminates. During this time, other transactions that are executions of one of the four programs described in Exercise 6.6.1 may run. For each of the four isolation levels serializable, repeatable read, read committed, and read uncommitted tell what the effect on T of running at this isolation level is.