Given the

Question 2, please. Returns a pair consisting of the max value in the AD, and of the set of keys that attain that value.

My instructor saying my code has wrong indentation on several lines… please let me know which lines. I’ve asked this twice before and I haven’t got it yet

Implement a function called tautology? that takes as input a fully parenthesized formula and returns true if it is a tautology and false otherwise. As was the case in the previous lab, the formula will contain at least one set of parentheses for each operator, but may contain more. The best strategy for doing is to use an insight called Quine's method. It is based on the observation that if a formula, such as (p or (not p)), is a tautology, the result of substituting p with true is a tautology and the result of substituting p with false is also a tautology. This implies a computational strategy: to evaluate whether a formula F is a tautology 1. Collect all of the propositional variables. 2. Substitute every occurrence of the first variable with #t and every occurrence of the same variable with #f 3. Make two recursive calls to Tautology? “And” the results. 4. When all possible substitutions have been made, i.e., the formula contains only truth values, evaluate the formula and return…

Write a program that does two string functions: capitalize the first word of a phrase, and reverse the letters of words in odd positions within the phrase.  For this program it is acceptable to let punctuation be part of the word.  Write a capitalizeWords() and a reverseOddWords() method and call them in a test program.  Make certain to properly handle empty phrases, phrases with one and two words, and phrases with greater than two words.   For example, if the original phrase were: Learning Java is fun!  Java is powerful and easy to use The capitalized version would be: Learning Java Is Fun!  Java Is Powerful And Easy To Use And with reversed odd words would be: gninraeL Java sI Fun!  avaJ Is lufrewoP And ysaE To esU

Ensure that the input values representing fractions are stored with denominators that are positive integers. It doesn't require the user to only enter a positive denominator value; the user should not be inconvenienced by such a restriction. For example, whilst values of 1 / -2 are acceptable inputs for a fraction, the output representation should be -1 / 2. Solution should check the denominator input; if it is negative, swap the sign of both numerator and denominator instance variables. Test this functionality with  TestFraction class. //Import the essential package import java.util.ArrayList; import java.util.Scanner; //Define the class Fraction class Fraction { //Declare the variables to store the numerator and denominator private int n, d; //Define the default constructor public Fraction() { //Initialize the values this.n = this.d = 0; } //Define the parameterized constructor public Fraction(int n, int d) { //Initialize the variables this.n = n; this.d = d; } //Define the getter…

t for several problems you will modify some provided Python code to implement algorithms to solve the same instance of the knapsack problem. After implementing all of the code and solving the problem, you must provide a single table of all results similar to the following: Table 1: Example of results summary (numbers are not realistic) Algorithm Iterations Items Selected Weight Objective Local Search (Best Improvement) 3102 49 97 117 Local Search with Random Restarts (k = 100) Local Search with Random walk (p = 0.25) 9510 121 21 147 2102 87 32 184 etc. Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and weight (w), select a combination of the items to maximize the total value without exceeding the weight limitations, W, of the knapsack. IMPORTANT!: When generating random problem instance set you must use the code provided and values: n = 150; max weight of 2500; and, use a seed value (for the random number generator) of 51132023.

Prove that code is correct.

Ok so im going to list my question and then the work so far. Here is the code so far:(THE PROBLEM WITH THE CODE IS THAT THE IM SUPPOSE TO USE FIND() TO REPEATEDLY CHANGE THE OCCURRENCE OF THE WORD "MASK" TO THE WORD "HAT" IN THE FILE BUT AM KIND OF LOST HAVE BEEN WORKING ON THIS FOR A WEEK AND A HALF) ALSO I CAN NOT use the replace method, count method, split method, range() function, or lists in your solution. HAVE BEEN TRYING TO FIND SUM WAY TO USE FIND() BUT AM COMING UP SHORT   CODE: #Get input file name fileOne = input("Enter the input file name :") #Get output file name fileTwo = input("Enter the output file name :") '''Get a string that will be searched in the source file to locate all occurrences of the string''' targetString = input("Enter the target string :") '''Get a string that will replace each occurrence of the target string in the source file''' replacementString = input("Enter the replacement string :") files =input("Enter a file with the word 'mask':") #Open…