3. Write an algorithm to create a tile pattern composed of black and white tiles, with a fringe of black tiles all around and two or three black tiles in the center, equally spaced from the boundary. Amount of rows = x Amount of columns = y Amount of spacing between side tiles and center tiles = z Repeat the following step for y times Print out one black tile Move to the next row Repeat the following steps for (x-3)/2 times Print out one black tile Repeat the following steps for y-2 times Print out one white tile Print out one black tile Move to next row Repeat the following for x-2-(2*((x-3)/2)) times Print out one black tile Repeat the following step for z times Print out one white tile Repeat the following step for x-2-2*z times Print out one black tile Repeat the following step for z times Print out one white tile Print out one black tile Move to next row Repeat the following steps for (x-3)/2 times Print out one black tile Repeat the following steps for y-2 times Print out one white tile Print out one black tile Move to next row Repeat the following step for y times Print out one black tile 4. Given an integer, print out each digit of that integer. user input = integer Amount of digits in the integer = #digits Repeat the following steps for #digits times Print out the last digit of the most current form of integer cut the last digit (just counted) off from the most current form of integer 5. Given a 16-digit credit card number, print out the sum of all digits. sum of all digits = sum 16-digit credit card number = integer Repeat the following steps for 16 times add the last digit of the most current form of integer to sum cut the last digit (just counted) off from the most current form of integer Print out sum