Consider a relational schema R(A, B, C, D, E, G, H, I) and a set of functional dependency F = {E --> D, C --> G, AB --> HI, G --> A}. Find out a key of R and perform a key-based BCNF decomposition of R. Justify whether the decomposition is dependency preserving.