For this Code Practice, use the following initializer list, terms terms = ["Bandwidth", “Hierarchy”, "IPV6", "Software", "Firewall", "Cybersecurity", “Lists”, "Program", "Logic", "Reliability”]

Write a sort program to alphabetize the list of computer terms, much like the preceding question. However, this time, define and use a function
named swap as part of your solution. The swap function should not be a sort function, but should instead implement the swap functionality used in
sorting. This function should swap the elements in the array at each of the indexes by comparing two elements to one another, and swapping them it
they need to be in a different alphabetical order.

Your function should take three parameters: the first is the array namne, and the second and third are the indexes to wap. Print the terms array before
and after it is sorted.

Expected Output:
['Bandwidth', 'Hierarchy', 'IPv6', 'Software', 'Firewall', 'Cybersecurity', 'Lists', 'Program', 'Logic', 'Reliability']
['Bandwidth', 'Cybersecurity', 'Firewall', 'Hierarchy', 'IPv6', 'Lists', 'Logic', 'Program', 'Reliability', 'Software'

Write a function 'music_func' that takes 3 parameters -- music type, music group, vocalist -- and prints them all out as shown in the example below. in case no input is provided by the user, the function should assume these values for the parameters: "classic rock", "the beatles", "freddie mercury". for example: input: alternative rock, pearl jam, chris cornell output: the best kind of music is alternative rock the best music group is pearl jam the best lead vocalist is chris cornell note: the print statements will go inside the for example: print("the best kind of music is"

Martha is designing a single-player game. her manager suggests that she plan the design to incorporate future modifications. which principle of game design relates to planning for future modifications?

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() { }