Write a function named encode_string[sentence) that takes a string value as its input and returns an encoded string, where each character of the input string is replaced by its ASCII code plus 3 values. Whitespace characters should not be encoded. For example, if the function was passed the input string: Hello world then it should return: Khoor Zrung For example: Test sentence "Hello World" print(encode_string[sentence)) Result Khoor Zruog

(Perkovic, Problem 6.31a) Craps is a single player dice game, that proceeds as follows: 1. the player rolls 2 six-sided dice once 。 if the total is 7 or 11, the player wins o if the total is 2, 3 or 12, the player loses 。 otherwise, the game continues, ... see 2 ... 2. the player the continues to roll the dice repeatedly, until ... 。 the total is the same as the original total (from 1), in which case the player wins 。 the total is 7, in which case the player loses Write a function craps that simulates a single game of craps (may be many rolls) and returns 1 if the player wins and 0 otherwise. 1 >>> import random 2 >>> random.seed(0) 3 >>> craps () 4 5 0 >>> random.seed(1) 6 LO 7 1 8 >>> craps () >>> random.seed(2) 9 >>> craps () 10 0 11 12 >>> [ (i, random.seed(i), craps()) for i in range(20)] [(0, None, 0), (1, None, 1), (2, None, 0), (3, None, 1), (4, None, 0), (5, None, 1), (6, None, 0), (7, None, 1), (8, None, 0), (9, None, 0), (10, None, 1), (11, None, 1), (12, None, 1), (13,…

(a) In the binary search algorithm, what are the four cases you have to consider at each iteration and what do you have to do in each case?

1. (3 points) Convert (137)10 to ( ) 16- Show your work to receive credit.