<prompt> Fumana palo ea mekhoa ea ho etsa phetoho bakeng sa palo e fanoeng u sebelisa lichelete tsa tšepe tsa likereke tse fanoeng.Tjhelete 8 Dikereke 1,2,4  <response>: Instruction in English: Find the number of ways to make change for a given amount using coins of given denominations. . Response in English: In order to find the number of ways to make change for the given amount using coins of given denominations, we can use dynamic programming to solve this problem. We can create an array dp of size amount 1, such that dpi represents the number of ways to make change for i cents. For example, when Amount 8 and Denominations 1, 2, 4:const int amount 8;const int coins 1, 2, 4;int dpamount 1;memsetdp, 0, sizeofdp;dp0 1;for int i 0; i 3; i for int j coinsi; j amount; j dpj dpj - coinsi; cout dpamount endl; 6As we can see, the number of ways to make change for amount 8 using coins of denominations 1, 2, 4 is 6. . Response in Sesotho: le ho fumana palo ea litsela tsa ho etsa phetoho bakeng sa chelete e fanoeng ka lichelete tsa tšepe tsa lihlopha tse fanoeng, re ka sebelisa mananeo a matla ho rarolla bothata bona. Re ka theha sehlopha sa dp sa boholo ba palo 1, hoo dpi e emelang palo ea mekhoa ea ho etsa phetoho bakeng sa lisente. Ka mohlala, ha Chelete 8 le Malumeli 1, 2, 4: const int amount 8; const int coins 1, 2, 4; int dpchelete 1; memsetdp, 0, sizeofdp; dp0 1; bakeng sa int i 0; i 3; i bakeng sa int j lichelete tsa tšepei; j chelete; j dpj dpj - lichelete tsa tšepei; cout dpamount endl; 6 Joalo ka ha re bona, palo ea mekhoa ea ho etsa phetoho bakeng sa palo ea 8 ho sebelisa lichelete tsa tšepe tsa likereke 1, 2, 4 ke 6. 