A) Suppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C) (A, D, E) and if the following set F of functional dependencies holds: A BC CD E B D E A

On R. Check if the decomposition is lossless join decomposition. Show all the steps clearly.

B) In a recoverable schedule, no transaction will ever be aborted because a transaction that it read from has been aborted. Justify whether the statement is true or false with appropriate example schedule.