Suppose a 3072 byte file in this filesystem has its directory entry stored in cluster 5, and its first cluster of data stored in cluster 7, its second in cluster 9, and its third in cluster 8. Ignoring changes to last modification timestamps, if we appended 128 bytes to this file, storing the extra data in cluster 10, then which of the following would be modified? A. the contents of cluster 5.
B. the FAT entry for cluster 5.
C. the contents of cluster 7, 8, and/or 9.
D. the FAT entry for cluster 7.
E. the FAT entry for cluster 9.
F. the FAT entry for cluster 10.

Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.

Jenny wants to create an animated short video to add to her website. which software will she use to create this animated video?

Aselect query joins tables together by their a. table names. b. primary keys. c. first entries. d. field names.