SUBJECTIVE TYPETotal marks: [20] = LetQ= {q1:42:23; 24;25} be a set of queries, A = {A1; A2; A3, A4; A5} be a set of attributes, and s {S1; S2, S3} be a set of sites. The matrix of (Figure a)describes the attribute usage values and the matrix of (Figure b) gives theapplication access frequencies. Assume that refi(qk) = 2 for all qk and S, and thatA1 is the key attribute. Use the bond energy and vertical partitioning algorithms toobtain a vertical fragmentation of the set of attributes in A. | Az Az A S, S2 S3 91 0 1 1 0 1 15 10 0 AM As, S 91 92 1 1 1 0 1 92 5 0 10 93 1 0 0 1 1 93 0 0 20 94 0 0 1 0 0 94 0 10 0 95 1 1 1 0 0 95 0 15 0 (a) (b) SUBJECTIVE TYPETotal marks: [20] = LetQ= {q1:42:23; 24;25} be a set of queries, A = {A1; A2; A3, A4; A5} be a set of attributes, and s {S1; S2, S3} be a set of sites. The matrix of (Figure a)describes the attribute usage values and the matrix of (Figure b) gives theapplication access frequencies. Assume that refi(qk) = 2 for all qk and S, and thatA1 is the key attribute. Use the bond energy and vertical partitioning algorithms toobtain a vertical fragmentation of the set of attributes in A. | Az Az A S, S2 S3 91 0 1 1 0 1 15 10 0 AM As, S 91 92 1 1 1 0 1 92 5 0 10 93 1 0 0 1 1 93 0 0 20 94 0 0 1 0 0 94 0 10 0 95 1 1 1 0 0 95 0 15 0 (a) (b)