Consider the problem of training a tlu (threshold logic unit) to do logical disjunction using the error-correction procedure. suppose that we start with the initial weights all equal to 0, and learning rate c=1. find a minimal set of training instances that will correctly train the tlu (threshold logic unit) according to the procedure. here a training set is minimal if removing any instance in it will not produce a tlu (threshold logic unit) for the logical disjunction. show the details of your work including the converging sequence of the weights

Write a defining table and then a program that determines if you can sleep in or not. your program should get all its input from your computer’s clock. on all weekdays (monday through friday) that are not holidays, your program should output “get up! ” on all other days (weekends and holidays), your program should output “sleep in.” the three holidays that your program must check for are january 1 (new year’s day), july 4 (u.s. independence day), and december 25 (christmas). you don’t need to include other holidays in your program because most other holidays do not occur on a fixed day each year.