Six integers are given in this order: 8, 4, 3, 5, 9, 6, 1. do each of the following. showyour work step by step. create an avl tree to store these data by inserting the integers in the given order, then delete node 5 from the tree. create a (2, 3) tree to store these data, then delete 6 from the tree. create a heap to store these data using the top-down approach (i. e., insert keys into the heap one after another).

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.

When running anti-virus software , what could be a reason where recipitent is not guaranteed that data being streamed will not get interrupted?

Melissa needs to add a topic to an email that she will send to her teacher. choose the name of the field where she should type her topic.