You are given a DFA A which accepts some language L. Describe a method to build an automaton B (it can be an NFA) which accepts the language of all strings that begin with some string in L. Demonstrate your construction on at least one non-trivial example.

I need some help generating a UML diagram from this assigment.

Java language

Solve the anagram problem again, this time using sets.   public class AnagramWithSets{public static boolean solution(String word1, String word2){// ↓↓↓↓ your code goes here ↓↓↓↓return true;}}

Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…

I want to know what am i doing wrong in HASKELL code below its regsrding functors

Implement a function that takes two strings of equal length and returns the distance between two strings is the number of positions at which the corresponding symbols are different.Check if thr given strings are of equal length, if not,return-1 PHYTHON LANGUAGE