Define a class for a soccer (football) player. Each player has the following properties or characteristics:
a name (a String)
a team (a String)
number of games played (an integer)
total number of goals scored (an integer)
Provide the following functionality:
a constructor (given name and team, start the others at zero)
a toString method accessors for each property
a method to compute and return the average goals per game
a mutator method, given the number of goals scored in one game, update the number of games and the goals scored
a mutator method, to set the team to the given team.
Also define a class to test this one containing a main program that does the following:
instantiate a player for Cristiano Ronaldo with Real Madrid.
output all the information on Ronaldo (from the instance).
update Ronaldo's information for one game scoring 3 goals.
update Ronaldo's information for one game scoring 1 goal.
output the average goals per game for Ronaldo.
output just Ronaldo's team (from the instance).
change Ronaldo's team to Juventus.
output all the information on Ronaldo (from the instance).
Notice that there is no input from the user. This does not have to be compiled and tested.

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Acomputer has a two-level cache. suppose that 60% of the memory references hit on the first level cache, 35% hit on the second level, and 5% miss. the access times are 5 nsec, 15 nsec, and 60 nsec, respectively, where the times for the level 2 cache and memory start counting at the moment it is known that they are needed (e.g., a level 2 cache access does not even start until the level 1 cache miss occurs). what is the average access time?

Draw the resistor’s voltage and current phasors at t=15ms. draw the vectors with their tails at the origin. the orientation of your vectors will be graded. the exact length of your vectors will not be graded.