Consider the following collection of relations and dependencies. assume that each relation is obtained through decomposition from a relation with attributes abcdefghi and that all the known dependencies over relation abcdefghi are listed for each question. (the questions are independent of each other, obviously, since the given dependencies over abcdefghi are different.)for each (sub)relation: (a) state the strongest normal form that the relation is in. (b) if it is not in bcnf, decompose it into a collection of bcnf relations.1. r1(a, c, b, d, e), a b, c-d2. r2(a, b, f), ac-e, b-f3. r3(a, d), d g, g h4. r4(d, c, h, g), a , a5. r5(a, i, c, e)

If your accelerator suddenly gets stuck what should you do

Design a class tictactoe that: holds the following information about the game: two-dimensional array (3 by 3), and winner. add additional variables as needed. includes the functions to perform the various operations on objects. for example, function to print the board, getting the move, checking if move is valid, determining if there is a winner after each move. add additional operations as needed. includes constructor(s). write the functions of the class, and write a program that uses the class. the program should declare an object of type tictactoe. the program will create the board and store it in the array. the program will allow two players to play the tic-tac-toe game. after every valid move update the array, check if there is a winner. if there is no winner and no tie, then print the board again to continue.

Which of the following would not be considered a pc? a. mainframe b. desktop c. tablet pc d. laptop