⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️WARNING THE VIRUS LINK POSTER POSTES LINKS FULL OF VIRUSES IF YOU SEE HER REPORT HER RIGHT AWAY SHE NEEDS TO BE COMPLETELY BANNED FROM BRANLY SHE MADE A LOT OF COPIES OF HER SELF WITH DIFFERENT NAMES BUT SHE HAS THE SAME PROFILE PICTURE IT LOOK LIKEA SITTING GIRL WITH A SMOOCHY FACE ⚠⚠⚠⚠☠⚠️⚠⚠⚠⚠⚠⚠⚠☠⚠️⚠⚠⚠⚠⚠⚠⚠☠⚠️⚠⚠⚠⚠⚠⚠⚠☠ ⚠️

⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠️⚠☠⚠ ️⚠☠⚠️⚠☠

⚠☠⚠️⚠☠⚠️ COPY AND PASTE THIS TO SPREAD

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.

Someone with this coz i don’t really know what i can choose, just pick whatever u want. homework - you need to choose a website that you like or use frequently. you must visit the website and discuss 6 different features/parts/aspects of the website that you think makes it good. (100 words)

This question involves a class named textfile that represents a text file. public class textfile { private string filename; private string filename; private arraylist words; // constructors not shown // postcondition: returns the number of bytes in this file public int filesize() { } // precondition: 0 < = index < words.size() // postcondition: removes numwords words from the words arraylist beginning at // index. public void deletewords(int index, int numwords) { } // precondition: 0 < = index < = words.size() // postcondition: adds elements from newwords array to words arraylist beginning // at index. pub lic voidaddwords(int index, string[] newwords) { } // other methods not shown } complete the filesize() method. the filesize() is computed in bytes. in a text file, each character in each word counts as one byte. in addition, there is a space in between each word in the words arraylist, and each of those spaces also counts as one byte. for example, suppose the words arraylist stores the following words: { mary had a little lamb; its fleece was white as snow. } the filesize() method would compute 4 + 3 + 1 + 6 + 5 + 4 + 6 + 3 + 5 + 2 + 5 as the sum of the lengths of each string in the arraylist. the value returned would be this sum plus 10, because there would also be 10 spaces in between the 11 words. complete the filesize() method below: // postcondition: returns the number of bytes in this file public int filesize() { }