Define a recursive function suffix that accepts a positive integer n and a list xs as input, and returns the list of elements that remain after the first n elements are dropped from the front of the list xs. - This function must have a recursive definition, and may not use any library functions! Test you function: suffix 1 0 - 0 > printin*%* suffix 20 > printin "%" suffix 1 [1] n > printin "b" suffix 1 [1:2] - [2] > printin "X" suffix 6 [1..9) - [7;8;9) > printin "X" The output of the above code should be following:true true true true true

Look at the far left lane in the picture. explain what the red car is doing and what it needs to do to travel safely.

In this lab, you complete a python program that calculates an employee's annual bonus. input is an employee's first name, last name, salary, and numeric performance rating. if the rating is 1, 2, or 3, the bonus rate used is .25, .15, or .1 respectively. if the rating is 4 or higher, the rate is 0. the employee bonus is calculated by multiplying the bonus rate by the annual salary.

This program should be a short piece of code that prints all of the positive integers from 1 to 100 as described more fully below. the program may contain multiple methods, and if using an oo language, should be contained within a single class or object. the program should be designed so that it begins execution when invoked through whichever mechanism is most common for the implementation language. â–ş print out all positive integers from 1 to 100, inclusive and in order. â–ş print messages to standard output, matching the sample output below. â–ş in the output, state whether the each integer is 'odd' or 'even' in the output. â–ş if the number is divisible by three, instead of stating that the number is odd or even, state that the number is 'divisible by three'. â–ş if the number is divisible by both two and three, instead of saying that the number is odd, even or divisible by three; state that the number is 'divisible by two and three'. â–ş design the logic of the loop to be as efficient as possible, using the minimal number of operations to perform the required logic. sample output the number '1' is odd. the number '2' is even. the number '3' is divisible by three. the number '6' is divisible by two and three.