This term, we’re building the components of a simple file synchronization system. In the first assignment, you wrote code for computing the hash of input from standard input, so that we can identify when files have changed. In the second assignment, you wrote code to build and traverse a file tree. Finally, in this assignment, you’ll actually implement file synchronization by copying files from a source file tree to a destination file tree. (In essence, you will be implementing the functionality of without any special options.) You’ll use multiple processes to complete this work in parallel, to (hopefully) speed up the task.