Consider the following set F of functional dependencies on the relation schema(A, B, C, D, E, G):A → BCDBC → DEB → DD → Aa. Compute B+. b. Prove (using Armstrong’s axioms) that AG is a superkey. c. Compute a canonical cover for this set of functional dependencies F; give each step of your derivation with an explanation. d. Give a 3NF decomposition of the given schema based on a canonical cover. e. Give a BCNF decomposition of the given schema using the original set F of functional dependencies.

Write the command that can be used to answer the following questions. (hint: try each out on the system to check your results.) a. find all files on the system that have the word test" as part of their filename. b. search the path variable for the pathname to the awk command. c. find all files in the /usr directory and subdirectories that are larger than 50 kilobytes in size. d. find all files in the /usr directory and subdirectories that are less than 70 kilobytes in size. e. find all files in the / directory and subdirectories that are symbolic links. f. find all files in the /var directory and subdirectories that were accessed less than 60 minutes ago. g. find all files in the /var directory and subdirectories that were accessed less than six days ago. h. find all files in the /home directory and subdirectories that are empty. i. find all files in the /etc directory and subdirectories that are owned by the group bin."

What provides an array of buttons for quick access to commonly used commands and tools

For the following example of making a peanut butter and jelly sandwich, identify which are inputs, processes, or outputs: bread scooping and spreading peanut butter plate scooping and spreading jelly finished sandwich putting two pieces of covered bread together dirty plate crumbs