#Lebron James: Statistics for 2003/2004 - 2012/2013 games_played = [79, 80, 79, 78, 75, 81, 76, 79, 62, 76] points = [1654, 2175, 2478, 2132, 2250, 2304, 2258, 2111, 1683, 2036] assists = [460, 636, 814, 701, 771, 762, 773, 663, 502, 535] rebounds = [432, 588, 556, 526, 592, 613, 554, 590, 492, 610] # Print total points # Print Average PPG # Print best scoring years (Ex: 2004/2005) # Print worst scoring years (Ex: 2004/2005)dComplete the following program using functions from the table above to find some statistics about basketball player Lebron James. The code below provides lists of various statistical categories for the years 2003-2013. Compute and print the following statistics:Total career points Average points per game
Years of the highest and lowest scoring season

What is the first view you place in your drawing?

Jason, samantha, ravi, sheila, and ankit are preparing for an upcoming marathon. each day of the week, they run a certain number of miles and write them into a notebook. at the end of the week, they would like to know the number of miles run each day, the total miles for the week, and average miles run each day. write a program to them analyze their data. your program must contain parallel arrays: an array to store the names of the runners and a two-dimensional array of five rows and seven columns to store the number of miles run by each runner each day. furthermore, your program must contain at least the following functions: a function to read and store the runners’ names and the numbers of miles run each day; a function to find the total miles run by each runner and the average number of miles run each day; and a function to output the results. (you may assume that the input data is stored in a file and each line of data is in the following form: runnername milesday1 milesday2 milesday3 milesday4 milesday5 milesday6 milesday7.)

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is