Okay guys Discrete Optimization. We going to start very, very slowly. So what you're going to see here is amazingly simply. We are building the intuitions. And in the next couple of lectures, we are basically solving these knapsack problems. Going from very simple things to more interesting things, okay? So, we want to introduce greedy algorithm. And what would Indiana Jones do if he doesn't know anything about discrete optimization and hasn't taken the class in Coursera, right? So, this is what you have. The temple is collapsing and you have all these beautiful artifacts, right? So you have the Agamemnon mask. You have the Terracotta warriors. You have the Sumerian tablets. And of course, you know, Indiana Jones is pretty smart, right? So he can evaluate the value of every one of these item immediately right? So, 13 millions for the mask, 1 million for the, the little statues over there, right? So the warrior. Okay so now what Indiana Jones is going to say, he's going to say oh, but I also have to evaluate the size of my knapsack and he can figure it out very quickly right? So this is about ten kilos, okay? And then obviously what he has to do and once again he's really clever, right? He has to evaluate the, the weight of every one of these artifacts as well. Okay? And once you have all these things, okay? What Indiana Jones is going to do is to say okay I'm going to pick up the right ones, what I believe are the right ones. Not knowing anything about optimization. And of course you can't resist, right? The first thing you're going to do is take this mask, it's so beautiful, right? So that's the first thing he does okay? And obviously that's eight kilos. So there is only two kilos left inside the knapsack, okay? So essentially, these items cannot be selected anymore. The only thing which is left are the warriors there. And Indiana Jones is going to select one of them and then exhaust the capacity of its, of its knapsack. Okay, the value here is about 14, is exactly 14 millions. And the whole point of this class is going to say. Can we do better than this? One of the things we'll do here, is talk in the first, in the next lecture is talk about greedy algorithm. And what you just saw is essentially, a very simple instance of a greedy algorithm. We take the most valuable item first and then the next valuable item that can fit into a knapsack. But there are many, many possible greedy algorithms. In the next lecture, we'll review some of them. And then afterwards, what we'll do is basically look at more sophisticated technique. I told you, very simple lecture, this is the first one. See you next time.