Given the following set of tasks and their associated profits and deadlines, what is the most appropriate value of x such that any further incoming tasks can be accommodated to maximize the profit? Task Deadline Profit 2 4 12 3. 9. 4. 9. 5 29 6. 10 7. 23 12 9. 6. 10 11 6. 12 9 6.

1 1 correct 1 1 correct 8 8 correct 80 370 8 correct 370 At least one of the answers above is NOT correct. (1 point) Fermat's "Little" Theorem states that whenver n is prime and a is an integer, an n-1 = 1 mod n 431 and n = 491, then efficiently compute a) If a = 431490 = 1 mod 491 b) If a = 204 and n = : 233, then efficiently compute . 204 204231 = 1 mod 233 Use the Extended Euclidean Algorithm to compute 204-¹ = 1 8 Then 2042318 c) If a mod 233. mod 233. = 807 and n = 881, then efficiently compute 807882 = 370 mod 881 incorrect

MATLAB PROBLEM

() Wride the bonlowering in mathematica expression z= Je'ry? + loe-yt b. q EK

Data Mining - cosine similarity, Jaccard coefficient, Euclidean distance, correlation coefficient.

Define a Racket function that takes as input two numerical values n and m and returns the value given by the expression

Matlab code Code for Hermite polynomials using divided differencesWith an example of computing the Hermite polynomial of degree 5, f(1.5)

algorithms