Answer:
false
Explanation:
Ms word is only an application software
#include
Program: using namespace std;
string createPurchaseOrder0;
int main(
{
cout<return 0;
}
string createPurchaseOrder(
{
int qty;
double costPerltem;
string description,info="":
cout<<"Enter Quantity:
cin>>qty;
cout<<"Enter cost per item: "
cin>>costPerltem;
cout<<"Enter Description: "
cin>>description;
if(qty<0 I| costPerltem<0
Idescription.compare(''"')==0)
cout<<'InThe entered data is invalid!":
info="":
else
"
cout<<"'InThe entered data is valid!":
info=info+"'(nQuantity: "+to_string (qty) +" In";
info=info+"Cost per item:
"†to_string (costPerltem)+"In";
info=info+"Description: "description+" In";
return info;
Output:
Answer:
Consider the language defined by the following regular expression. (x*y | zy*)* 1. Does zyyxz belong to the language?
O. No, because zyy does not belong to x*y nor zy*
2. Does zyyzy belong to the language?
Yes, because both zy and zyy belong to zy*.
Explanation:
