Write a program that implements Huffman algorithm and test it by encoding and decoding a set of files. See files in the assignment folder for the partial pseudocode that you may use to implement the program. You have to devise the complete algorithms yourself or find them elsewhere, for example, in the textbook. The assignment folder also contains input files and correspondent expected output files. Note that different input files may be used for the grading. Submit your program source code, input files, and output files into Lab6 folder.

How are natural numbers, whole numbers, integers, and rational numbers related

6. the is particularly susceptible to the effects of alcohol because it receives a large portion of total blood flow and has a high concentration of neurons. a. heart b. pancreas c. brain d. liver

You will be given two character arrays of the same size, one will contain a number of ships. ships will move around the character array based on which way they are facing and the route they are on. routes are given in the other array. the route consists of '-' and '|' for straight paths, '\' and '/' for curves, and '+' for intersections. there are ships on these routes. ships always face a direction, '^' for up, '> ' for right, 'v' for down, and '< ' for left. any time the ships hit a '\' or a '/' it will turn as you would expect a ship to turn (e.g. a '^' that moves into a '/' will turn right). at an intersection, ships will always continue straight through. all ships move at the same speed, ships take turns moving and all ships move during one 'tick'. the one in the most top left goes first, followed by those to its right, then the ones in the next row. it iterates along the rows and then down the columns. each ship moves one space on its turn moving along the route. your function needs to return the position of the first collision between two ships and the number of ticks before the crash occurred.