To create a simple chart from scratch in word
Click Insert > Chart.
Click the chart type and then double-click the chart you want.
In the spreadsheet that appears, replace the default data with your own information.
Tip: When you insert a chart, small buttons appear next to its upper-right corner. Use the Chart Elements button to show, hide, or format things like axis titles or data labels. Or use the Chart Styles  button to quickly change the color or style of the chart. The Chart Filters  button is a more advanced option that shows or hides data in your chart.
When you’ve finished, close the spreadsheet.
If you want, use the Layout Options button to arrange the chart and text in your document.
The correct scripts are:
chmod 765 script1
chmod u+x script1
A cοmmand is an instructiοn givеn by a usеr tеlling a cοmputеr tο dο sοmеthing, such a run a singlе prοgram οr a grοup οf linkеd prοgrams. Cοmmands arе gеnеrally issuеd by typing thеm in at thе cοmmand linе (i.е., thе all-tеxt display mοdе) and thеn prеssing thе ЕNTЕR kеy, which passеs thеm tο thе shеll.
In Unix-likе οpеrating systеms, chmοd is thе cοmmand and systеm call which may changе thе accеss pеrmissiοns tο filе systеm οbjеcts. It may alsο altеr spеcial mοdе flags. Thе rеquеst is filtеrеd by thе umask. Thе namе is an abbrеviatiοn οf changе mοdе.
Answer:
See explaination for the program code
Explanation:
The code below
Pseudo-code:
//each item ai is used at most once
isSubsetSum(A[],n,t)//takes array of items of size n, and sum t
{
boolean subset[n+1][t+1];//creating a boolean mtraix
for i=1 to n+1
subset[i][1] = true; //initially setting all first column values as true
for i = 2 to t+1
subset[1][i] = false; //initialy setting all first row values as false
for i=2 to n
{
for j=2 to t
{
if(j<A[i-1])
subset[i][j] = subset[i-1][j];
if (j >= A[i-1])
subset[i][j] = subset[i-1][j] ||
subset[i - 1][j-set[i-1]];
}
}
//returns true if there is a subset with given sum t
//other wise returns false
return subset[n][t];
}
Recurrence relation:
T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times
T(1)=1
solving recurrence:
T(n)=T(n-1)+t
T(n)=T(n-2)+t+t
T(n)=T(n-2)+2t
T(n)=T(n-3)+3t
,,
,
T(n)=T(n-n-1)+(n-1)t
T(n)=T(1)+(n-1)t
T(n)=1+(n-1)t = O(nt)
//so complexity is :O(nt)//where n is number of element, t is given sum
C stay away from his or her vechicle
Free version also know as the lite version that has less feature and but still allows the user to use the the core functionality
